Search results
Create the page "2004 AIME I Problem 14" on this wiki! See also the search results found.
Page title matches
- == Problem == {{AIME box|year=2004|n=I|num-b=13|num-a=15}}4 KB (729 words) - 01:00, 27 November 2022
Page text matches
- ...lity, with equality holding when <math>A^*, B^*, C^*</math> are collinear, i.e. when <math>A,B,C</math> lie on a circle containing <math>D.</math> Addit ===2023 AIME I Problem 5===6 KB (922 words) - 17:34, 13 January 2025
- 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
- * [[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
- ...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 i5 KB (860 words) - 15:36, 10 December 2023
- ...c sequence with common difference <math>-8</math>; however, <math>7, 0, 7, 14</math> and <math>4, 12, 36, 108, \ldots</math> are not arithmetic sequences * [[2005_AMC_10A_Problems/Problem_17 | 2005 AMC 10A Problem 17]]4 KB (736 words) - 02:00, 7 March 2024
- ...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
- ...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
- ...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
- {{AIME Problems|year=2005|n=I}} == Problem 1 ==6 KB (983 words) - 05:06, 20 February 2019
- == Problem == We approach the problem by [[recursion]]. We [[partition]] the positive integers into the sets9 KB (1,491 words) - 01:23, 26 December 2022
- == 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
- == Problem == draw((9*4/14,0)--(9*4/14,5*3/14),dashed);4 KB (647 words) - 17:43, 23 November 2024
- == Problem == ...ient of <math>x</math> in <math>P(x)</math> is <math>-1 + 2 - 3 + \ldots + 14 - 15 = -8</math>, so <math>P(x) = 1 -8x + Cx^2 + Q(x)</math>, where <math>Q7 KB (1,099 words) - 13:41, 30 December 2024
- {{AIME Problems|year=2004|n=I}} == Problem 1 ==9 KB (1,434 words) - 13:34, 29 December 2021
- {{AIME Problems|year=2004|n=II}} == Problem 1 ==9 KB (1,410 words) - 05:05, 20 February 2019
- {{AIME Problems|year=2003|n=II}} == Problem 1 ==7 KB (1,127 words) - 09:02, 11 July 2023
- == Problem == ...}</math>, so the sum of these elements is <math>\sum_{i=0}^{5} {2i \choose i} = 1 + 2 +6 + 20 + 70 + 252 = 351</math>.4 KB (651 words) - 19:42, 7 October 2023
- == Problem 1 == [[Mock AIME 1 Pre 2005 Problems/Problem 1|Solution]]6 KB (1,100 words) - 22:35, 9 January 2016
- * [[2019 AMC 8 Problems/Problem 24]] * [[2016 AMC 10A Problems/Problem 19]]5 KB (812 words) - 15:43, 1 March 2025
- ==Problem 1== [[Mock AIME 4 Pre 2005/Problems/Problem 1 | Solution]]7 KB (1,094 words) - 15:39, 24 March 2019
