Search results
Create the page "2004 AIME II Problem 7" on this wiki! See also the search results found.
Page title matches
- == Problem == defaultpen(linewidth(0.7)+fontsize(10));9 KB (1,500 words) - 20:06, 8 October 2024
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. '''Solution''': We divide the problem into cases, based on how long the word is.5 KB (709 words) - 17:40, 24 September 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
- {{AIME Problems|year=2004|n=I}} == Problem 1 ==9 KB (1,434 words) - 13:34, 29 December 2021
- == Problem == Now, consider the strip of length <math>1024</math>. The problem asks for <math>s_{941, 10}</math>. We can derive some useful recurrences f6 KB (899 words) - 20:58, 12 May 2022
- == Problem == ...ample, <math> 7+77+777+7+7=875 </math> could be obtained from eight <math> 7 </math>'s in this way. For how many values of <math> n </math> is it possib11 KB (1,857 words) - 12:57, 18 July 2024
- == Problem == pointpen = black; pathpen = black+linewidth(0.7);3 KB (486 words) - 22:15, 7 April 2023
- == Problem == ...a [[base]] with [[radius]] <math>600</math> and [[height]] <math> 200\sqrt{7}. </math> A fly starts at a point on the surface of the cone whose distance2 KB (268 words) - 22:20, 23 March 2023
- == Problem == ...>x</math> is <math>37+31+25+\ldots+1 = 7 + 36 + 30 + 24 + \ldots + 6 + 0 = 7 + 6 \cdot (6 + 5 + 4\ldots + 1) </math>8 KB (1,283 words) - 19:19, 8 May 2024
- == Problem == ...f(n)^2\, \mathrm{or}\, f(n)f(n-1) < 1000</math>. This happens with <math>f(7)f(8) = 29 \cdot 33 = 957</math>, and this is the <math>2(8) = 16</math>th t3 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 == defaultpen(linewidth(0.7)+fontsize(10));9 KB (1,500 words) - 20:06, 8 October 2024
- == Problem == ...al. Also note some other conditions we have picked up in the course of the problem, namely that <math>b_1</math> is divisible by <math>8</math>, <math>b_2</ma6 KB (950 words) - 14:18, 15 January 2024
- == Problem == ...ogether as possible, which occurs when the smaller block is <math>3 \times 7 \times 11</math>. Then the extra layer makes the entire block <math>4\time2 KB (377 words) - 11:53, 10 March 2014
- == Problem == ...y picks two red candies after Terry chooses two red candies is <math>\frac{7\cdot8}{18\cdot17} = \frac{28}{153}</math>. So the probability that they bo2 KB (330 words) - 13:42, 1 January 2015
- {{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
- * [[2019 AMC 8 Problems/Problem 24]] * [[2016 AMC 10A Problems/Problem 19]]5 KB (812 words) - 15:43, 1 March 2025
