Search results
Create the page "2004 AIME II Problem 1" on this wiki! See also the search results found.
Page title matches
- == Problem == [[Image:2004 AIME II Problem 1.png]]2 KB (329 words) - 23:20, 4 July 2013
Page text matches
- ..., then adding together the totals of each part. Casework is a very general problem-solving approach, and as such has wide applicability. === Example 1 ===5 KB (709 words) - 17:40, 24 September 2024
- ...numbers''' arise when we try to solve [[equation]]s such as <math> x^2 = -1 </math>. ...this addition, we are not only able to find the solutions of <math> x^2 = -1 </math> but we can now find ''all'' solutions to ''every'' polynomial. (Se5 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
- {{AIME Problems|year=2005|n=I}} == Problem 1 ==6 KB (983 words) - 05:06, 20 February 2019
- {{AIME Problems|year=2004|n=I}} == Problem 1 ==9 KB (1,434 words) - 13:34, 29 December 2021
- == Problem == ...h and lie on top of the left end, resulting in a <math>256</math> by <math>1</math> strip of quadruple thickness. This process is repeated <math>8</math6 KB (899 words) - 20:58, 12 May 2022
- == Problem == == Solution 1 ==11 KB (1,857 words) - 12:57, 18 July 2024
- == Problem == D(MP("A",A,(1,0))--MP("B",B,N)--MP("C",C,NW)--MP("D",D)--MP("E",E)--cycle); D(D--A--C--E)3 KB (486 words) - 22:15, 7 April 2023
- == Problem == pair A=(0,0), B=(6,0), D=(1, 24^.5), C=(5,D.y), O = (3,(r^2 + 6*r)^.5);3 KB (431 words) - 23:21, 4 July 2013
- == Problem == ...> and <math> 2^{40} </math> whose binary expansions have exactly two <math>1</math>'s. If a number is chosen at random from <math> S, </math> the [[prob8 KB (1,283 words) - 19:19, 8 May 2024
- == Problem == ...} </math> are in geometric progression, and the terms <math> a_{2n}, a_{2n+1}, </math> and <math> a_{2n+2} </math> are in arithmetic progression. Let <m3 KB (535 words) - 22:25, 5 March 2025
- == Problem == ...tive integer divisors of <math>2004^{2004}</math> are divisible by exactly 2004 positive integers?2 KB (359 words) - 19:58, 24 December 2024
- == Problem == === Solution 1 (Synthetic) ===9 KB (1,500 words) - 20:06, 8 October 2024
- == Problem == ...d monkeys have at the end of the process are in the [[ratio]] <math> 3: 2: 1, </math>what is the least possible total for the number of bananas?6 KB (950 words) - 14:18, 15 January 2024
- ==Problem== ==Solution 1==4 KB (592 words) - 19:02, 26 September 2020
- == Problem == ...to arrange them in an <math>n</math>-digit number, for a total of <math>(2^1 - 2) + (2^2 - 2) + (2^3 -2) + (2^4 - 2) = 22</math> such numbers (or we can3 KB (508 words) - 01:16, 19 January 2024
- == Problem == ...ed so that three of its faces are visible, exactly <math>231</math> of the 1-cm cubes cannot be seen. Find the smallest possible value of <math> N. </ma2 KB (377 words) - 11:53, 10 March 2014
- == Problem == ...ferent candies will have the form <math>\frac{{10\choose 1}\cdot{10\choose 1}}{{20\choose2}}</math>. It is not difficult to see that these yield the sa2 KB (330 words) - 13:42, 1 January 2015
