Create the page "2004 AIME I Problem 13" on this wiki! See also the search results found.

Page title matches

• 2004 AIME I Problems/Problem 13
  == Problem == ...<math>34</math> complex roots of the form <math> z_k = r_k[\cos(2\pi a_k)+i\sin(2\pi a_k)], k=1, 2, 3,\ldots, 34, </math> with <math> 0 < a_1 \le a_2 \
  2 KB (298 words) - 20:02, 4 July 2013

Page text matches

• Constructive counting
  This is a problem where constructive counting is not the simplest way to proceed. This next e ...proceed with the construction. If we were to go like before and break the problem down by each box, we'd get a fairly messy solution.
  13 KB (2,018 words) - 15:31, 10 January 2025
• Recursion
  * [[Mock_AIME_2_2006-2007_Problems#Problem_8 | Mock AIME 2 2006-2007 Problem 8]] ([[number theory]]) *[[1994_AIME_Problems/Problem 9|1994 AIME Problem 9]]
  2 KB (316 words) - 16:03, 1 January 2024
• Fibonacci sequence
  ...of the two preceding it. The first few terms are <math>1, 1, 2, 3, 5, 8, 13, 21, 34, 55,...</math>. ...iv style="text-align:right">([[2000 AMC 12 Problems/Problem 4|2000 AMC 12, Problem 4]])</div>
  7 KB (1,111 words) - 14:57, 24 June 2024
• Complex number
  ...ver, it is possible to define a number, <math> i </math>, such that <math> i = \sqrt{-1} </math>. If we add this new number to the reals, we will have ...rm <math> a + bi </math> where <math> a,b\in \mathbb{R} </math> and <math> i = \sqrt{-1} </math> is the [[imaginary unit]]. The set of complex numbers i
  5 KB (860 words) - 15:36, 10 December 2023
• 2004 AIME I
  ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2004 AIME I Problems]]
  1 KB (135 words) - 18:15, 19 April 2021
• 2004 AIME II
  ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2004 AIME II Problems]]
  1 KB (135 words) - 12:24, 22 March 2011
• 2005 AIME I
  ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2005 AIME I Problems]]
  1 KB (154 words) - 12:30, 22 March 2011
• 2005 AIME I Problems
  {{AIME Problems|year=2005|n=I}} == Problem 1 ==
  6 KB (983 words) - 05:06, 20 February 2019
• 2004 AIME I Problems/Problem 15
  == Problem == We approach the problem by [[recursion]]. We [[partition]] the positive integers into the sets
  9 KB (1,491 words) - 01:23, 26 December 2022
• 2004 AIME I Problems/Problem 14
  == Problem == {{AIME box|year=2004|n=I|num-b=13|num-a=15}}
  4 KB (729 words) - 01:00, 27 November 2022
• 2004 AIME I Problems/Problem 12
  == Problem == {{AIME box|year=2004|n=I|num-b=11|num-a=13}}
  2 KB (303 words) - 18:43, 16 October 2024
• 2004 AIME I Problems/Problem 10
  == Problem == The location of the center of the circle must be in the <math>34 \times 13</math> rectangle that is one unit away from the sides of rectangle <math>AB
  5 KB (836 words) - 07:53, 15 October 2023
• 2004 AIME I Problems/Problem 7
  == Problem == ...um of the product of each pair of distinct terms, or <math>C = \sum_{1 \le i \neq j}^{15} S_iS_j</math>. Also, we know that
  7 KB (1,099 words) - 13:41, 30 December 2024
• 2004 AIME I Problems
  {{AIME Problems|year=2004|n=I}} == Problem 1 ==
  9 KB (1,434 words) - 13:34, 29 December 2021
• 2004 AIME II Problems/Problem 14
  == Problem == ...n't need to be nearly as rigorous). A more natural manner of attacking the problem is to think of the process in reverse, namely seeing that <math>n \equiv 1
  11 KB (1,857 words) - 12:57, 18 July 2024
• 2004 AIME II Problems/Problem 6
  == Problem == ...each fraction is equal to <math>8</math>, and the solution is <math>8(11 + 13 + 27) = \boxed{408}</math>.
  6 KB (950 words) - 14:18, 15 January 2024
• 2004 AIME II Problems
  {{AIME Problems|year=2004|n=II}} == Problem 1 ==
  9 KB (1,410 words) - 05:05, 20 February 2019
• 2003 AIME II Problems
  {{AIME Problems|year=2003|n=II}} == Problem 1 ==
  7 KB (1,127 words) - 09:02, 11 July 2023
• Mock AIME 1 Pre 2005 Problems
  == Problem 1 == [[Mock AIME 1 Pre 2005 Problems/Problem 1|Solution]]
  6 KB (1,100 words) - 22:35, 9 January 2016
• Cone
  ...of the cone’s height to its [[radius]]? ([[2003 AMC 12B Problems/Problem 13|Source]]) ...the square of any prime. Find <math>m + n</math>. ([[2008 AIME I Problems/Problem 5]])
  7 KB (1,128 words) - 23:27, 19 February 2025

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)