Search results
Create the page "2004 AIME I Problem 11" on this wiki! See also the search results found.
Page title matches
- == Problem == {{AIME box|year=2004|n=I|num-b=10|num-a=12}}5 KB (839 words) - 22:12, 16 December 2015
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
- * [[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
- ...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
- ...A number of '''Mock AMC''' competitions have been hosted on the [[Art of Problem Solving]] message boards. They are generally made by one community member ...amous theorems and formulas and see if there's any way you can make a good problem out of them.51 KB (6,175 words) - 21:41, 27 November 2024
- {{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 == {{AIME box|year=2004|n=I|num-b=11|num-a=13}}2 KB (303 words) - 18:43, 16 October 2024
- == Problem == {{AIME box|year=2004|num-b=9|num-a=11|n=I}}5 KB (836 words) - 07:53, 15 October 2023
- == 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 that7 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
- == Problem == ...nting <math>b</math>). Then <math>11b + 111c \le 855 + 2b + 3c \le 855 + 2(11) + 3(7) = 898 < 1000</math>, so these values work.11 KB (1,857 words) - 12:57, 18 July 2024
- == Problem == ...math>, the second monkey got <math>\frac{1}{8}b_1 + \frac{1}{4}b_2 + \frac{11}{24}b_3</math>, and the third monkey got <math>\frac{1}{8}b_1 + \frac{3}{8}6 KB (950 words) - 14:18, 15 January 2024
- {{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
- ...e ratio 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
