Search results
Create the page "2004 AIME II Problem 6" on this wiki! See also the search results found.
Page title matches
- == 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
Page text matches
- ...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 == ...CD </math> be an [[isosceles trapezoid]], whose dimensions are <math> AB = 6, BC=5=DA, </math>and <math> CD=4. </math> Draw [[circle]]s of [[radius]] 33 KB (431 words) - 23:21, 4 July 2013
- == Problem == ...}</math>. For example, with the binary string 0001001000 <math>y</math> is 6 and <math>x</math> is 3 (note that it is zero indexed).8 KB (1,283 words) - 19:19, 8 May 2024
- == 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 == It is clear from the problem setup that <math>0<\theta<\frac\pi2</math>, so the correct value is <math>\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
- {{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
- == Problem 1 == ...largest integer <math>k</math> such that <math>2004^k</math> divides <math>2004!</math>.6 KB (1,052 words) - 13:52, 9 June 2020
- ==Problem== Hence, <cmath>N = \frac{2005 \cdot 2004 \cdot 2003}{3 \cdot 2\cdot 1} \equiv \boxed{010} (\mathrm{mod} \hskip .2cm7 KB (1,187 words) - 05:58, 3 February 2025
- [[2019 AIME II Problems/Problem 15]] Solution 5 [[2023 USAJMO Problems/Problem 6]] Solution 110 KB (1,116 words) - 12:37, 11 June 2024
