Search results
Create the page "2004 AIME II Problem 5" on this wiki! See also the search results found.
Page title matches
- ==Problem== From the initial problem statement, we have <math>1000w\cdot\frac{1}{4}t=\frac{1}{4}</math>.4 KB (592 words) - 19:02, 26 September 2020
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
- *[[2007 AMC 12A Problems/Problem 18]] *[[1984 AIME Problems/Problem 8|1984 AIME Problem 8]]5 KB (860 words) - 15:36, 10 December 2023
- ...Cameron Matthews. In 2003, Crawford became the first employee of [[Art of Problem Solving]] where he helped to write and teach most of the online classes dur * Perfect score on the [[AIME]] as a freshman.2 KB (362 words) - 11:20, 27 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 == ...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 111 KB (1,857 words) - 12:57, 18 July 2024
- == Problem == ...allel CE, BC \parallel AD, AC \parallel DE, \angle ABC=120^\circ, AB=3, BC=5, </math> and <math>DE = 15. </math> Given that the [[ratio]] between the ar3 KB (486 words) - 22:15, 7 April 2023
- == Problem == ...ath> be an [[isosceles trapezoid]], whose dimensions are <math> AB = 6, BC=5=DA, </math>and <math> CD=4. </math> Draw [[circle]]s of [[radius]] 3 cente3 KB (431 words) - 23:21, 4 July 2013
- == Problem == ...h>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 == ...e [[quadratic formula]] or trial-and-error/modular arithmetic that <math>x=5</math>. Thus <math>f(n) = 4n+1</math>, and we need to find the largest <mat3 KB (535 words) - 22:25, 5 March 2025
- == Problem == pair point=( 12.5, 35/3 );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== From the initial problem statement, we have <math>1000w\cdot\frac{1}{4}t=\frac{1}{4}</math>.4 KB (592 words) - 19:02, 26 September 2020
- == Problem == We use casework on the number of digits for this problem.3 KB (508 words) - 01:16, 19 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
