New pages
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 09:45, 26 August 2025 2016 MPFG Problem 18 (hist) [771 bytes] Cassphe (talk | contribs) (Created page with "==Problem== Let <math>T = \{1, 2, 3, . . . , 14, 15\}</math>. Say that a subset <math>S</math> of <math>T</math> is handy if the sum of all the elements of <math>S</math> is a...")
- 00:13, 26 August 2025 2012 MPFG Problem 10 (hist) [1,994 bytes] Cassphe (talk | contribs) (Created page with "==Problem== Let <math>\Delta ABC</math> be a triangle with a right angle <math>\angle ABC</math>. Let <math>D</math> be the midpoint of <math>BC</math>, let <math>E</math> be...")
- 21:21, 25 August 2025 Log Sums Proof (hist) [772 bytes] Am24 (talk | contribs) (Created page with "The sum for logs with the same base goes as the following: <math>\log_{n}a+\log_{n}b=\log_{n}{ab}</math>. But how is this property true? Make <math>\log_{n}a=x</math> and <...")
- 00:18, 25 August 2025 2018 MPFG Problem 18 (hist) [1,343 bytes] Cassphe (talk | contribs) (Created page with "==Problem== Evaluate the expression <cmath>\left|\Pi_{k=0}^{15} (1+e^{2\pi ik^{2}/31})\right|</cmath> ==Solution 1== <math>\left|\Pi_{k=0}^{15} (1+e^{\frac{2\pi ik^{2}}{31}...")
- 10:36, 24 August 2025 2025 AMC 10A Problems/Problem 8 (hist) [0 bytes] Hongxiaobbb2 (talk | contribs) (wha)
- 01:46, 24 August 2025 2018 MPFG Problem 19 (hist) [1,342 bytes] Cassphe (talk | contribs) (Created page with "==Problem 19== Consider the sum <cmath>S_n = \sum_{k=1}^{n}\frac{1}{\sqrt{2k-1}}</cmath> Determine <math>\lfloor S_{4901} \rfloor</math>. Recall that if <math>x</math> is a...")
- 04:07, 23 August 2025 2011 MPFG Problem 14 (hist) [653 bytes] Cassphe (talk | contribs) (Created page with "==Problem== If <math>0 \leq p \leq 1</math> and <math>0 \leq p \leq 1</math>, define <math>F(p,q)</math> by <math>F(p,q) = -2pq + 3p(1-q) + 3(1-p)q-4(1-p)(1-q)</math>. Define...")
- 01:26, 22 August 2025 2012 MPFG Problem 8 (hist) [936 bytes] Cassphe (talk | contribs) (Created page with "==Problem== Suppose that <math>x</math>, <math>y</math>, and <math>z</math> are real numbers such that <math>x + y + z = 3</math> and <math>x^{2} + y^{2} + z^{2} = 6</math>. W...")
- 17:26, 21 August 2025 2025 AMC 10A Problems/Problem 7 (hist) [0 bytes] Endlessligh (talk | contribs) (Created page with "N=2 for n=1 is true for how many integers z?")
- 00:25, 21 August 2025 2013 MPFG Problem 17 (hist) [1,425 bytes] Cassphe (talk | contribs) (Created page with "==Problem== Let f be the function defined by <math>f(x) = -2 sin(\pi x)</math> . How many values of x such that <math> -2 \leq x \leq 2</math> satisfy the equation <math>f(f(f...")
- 22:38, 20 August 2025 2025 AMC 10A Problems/Problem 11 (hist) [0 bytes] Yuchen2013 (talk | contribs) (Created blank page)
- 17:18, 18 August 2025 2018 Putnam B Problems/Problem 6 (hist) [4,351 bytes] Pinotation (talk | contribs) (Created page with "==Problem== Let <math>S</math> be the set of sequences of length 2018 whose terms are in the set <math>\{1, 2, 3, 4, 5, 6, 10\}</math> and sum to 3860. Prove that the cardina...")
- 17:01, 18 August 2025 2018 Putnam B Problems/Problem 5 (hist) [5,507 bytes] Pinotation (talk | contribs) (Created page with "==Problem== Let <math>f = (f_1, f_2)</math> be a function from <math>\mathbb{R}^2</math> to <math>\mathbb{R}^2</math> with continuous partial derivatives <math>\tfrac{\partial...")
- 17:49, 17 August 2025 2018 Putnam B Problems/Problem 4 (hist) [1,861 bytes] Pinotation (talk | contribs) (Created page with "==Problem== Given a real number <math>a</math>, we define a sequence by <math>x_0 = 1</math>, <math>x_1 = x_2 = a</math>, and <math>x_{n+1} = 2x_nx_{n-1} - x_{n-2}</math> for...")
- 17:48, 17 August 2025 2018 Putnam B Problems/Problem 3 (hist) [1,886 bytes] Pinotation (talk | contribs) (Created page with "==Problem== Find all positive integers <math>n < 10^{100}</math> for which simultaneously <math>n</math> divides <math>2^n</math>, <math>n-1</math> divides <math>2^n - 1</mat...")
- 17:10, 17 August 2025 2018 Putnam B Problems/Problem 2 (hist) [3,756 bytes] Pinotation (talk | contribs) (Created page with "Let \( n \) be a positive integer, and let \( f_n(z) = n + (n-1)z + (n-2)z^2 + \dots + z^{n-1} \). Prove that \( f_n \) has no roots in the closed unit disk \( \{z \in \mathbb...")
- 14:29, 11 August 2025 2025 AMC 12A Problems/Problem 25 (hist) [0 bytes] Jxlly (talk | contribs) (Created page with "Nothing to see here my sigmas")
- 11:34, 11 August 2025 Newton raphson way (hist) [3,029 bytes] Mr maggi (talk | contribs) (The Newton-Raphson Method: Summary)
- 07:07, 11 August 2025 MPFG Alternative Solutions (hist) [696 bytes] Cassphe (talk | contribs) (Created page with "Here are some alternative solutions to the problems of [https://artofproblemsolving.com/wiki/index.php/Math_Prize_for_Girls MPFG]. The official solutions of these problems are...")
- 22:45, 10 August 2025 2025 AMC 10A Problems/Problem 2 (hist) [0 bytes] Applelover123 (talk | contribs) (Created page with "2")
