Create the page "2004 AIME II Problem 8" on this wiki! See also the search results found.

Page title matches

• 2004 AIME II Problems/Problem 8
  == 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

Page text matches

• Complex number
  *[[2007 AMC 12A Problems/Problem 18]] *[[1984 AIME Problems/Problem 8|1984 AIME Problem 8]]
  5 KB (860 words) - 15:36, 10 December 2023
• 2004 AIME I
  ...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
• 2004 AIME II
  ...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
• 2005 AIME I
  ...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
• 2005 AIME I Problems
  {{AIME Problems|year=2005|n=I}} == Problem 1 ==
  6 KB (983 words) - 05:06, 20 February 2019
• 2004 AIME I Problems
  {{AIME Problems|year=2004|n=I}} == Problem 1 ==
  9 KB (1,434 words) - 13:34, 29 December 2021
• 2004 AIME II Problems/Problem 15
  == Problem == ...math>1</math> strip of quadruple thickness. This process is repeated <math>8</math> more times. After the last fold, the strip has become a stack of <ma
  6 KB (899 words) - 20:58, 12 May 2022
• 2004 AIME II Problems/Problem 14
  == Problem == ...and the inequality <math>11b + 111c \le 954 + 2b + 3c \le 954 + 2(10) + 3(8) = 998 < 1000</math>. However, for <math>9k \ge 963 \Longrightarrow n \le 3
  11 KB (1,857 words) - 12:57, 18 July 2024
• 2004 AIME II Problems/Problem 12
  == Problem == ...linewidth(0.7); pen d = linewidth(0.7) + linetype("4 4"); pen f = fontsize(8);
  3 KB (431 words) - 23:21, 4 July 2013
• 2004 AIME II Problems/Problem 10
  == Problem == ...equiv 0 \pmod 9 \implies 2^{y-x} \equiv -1 \pmod 9 \implies 2^{y-x} \equiv 8 \pmod 9</cmath>
  8 KB (1,283 words) - 19:19, 8 May 2024
• 2004 AIME II Problems/Problem 9
  == Problem == ...ns with <math>f(7)f(8) = 29 \cdot 33 = 957</math>, and this is the <math>2(8) = 16</math>th term of the sequence.
  3 KB (535 words) - 22:25, 5 March 2025
• 2004 AIME II Problems/Problem 8
  == 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
• 2004 AIME II Problems/Problem 7
  == Problem == ...th> and <math> F </math> is on <math> CD. </math> The dimensions <math> AE=8, BE=17, </math> and <math> CF=3 </math> are given. The perimeter of rectang
  9 KB (1,500 words) - 20:06, 8 October 2024
• 2004 AIME II Problems/Problem 6
  == Problem == ...1}{24}b_3</math>, and the third monkey got <math>\frac{1}{8}b_1 + \frac{3}{8}b_2 + \frac{1}{12}b_3</math>.
  6 KB (950 words) - 14:18, 15 January 2024
• 2004 AIME II Problems/Problem 5
  ==Problem== ...rac{150}{8}</math>. The train then has <math>60-15-\frac{50}{3}-\frac{150}{8}=230/24</math> minutes left to travel 250 miles, and doing the arithmetic s
  4 KB (592 words) - 19:02, 26 September 2020
• 2004 AIME II Problems/Problem 4
  == Problem == We use casework on the number of digits for this problem.
  3 KB (508 words) - 01:16, 19 January 2024
• 2004 AIME II Problems/Problem 2
  == Problem == ...candies after Terry chose two red candies will have the form <math>\frac{{8\choose 2}}{{18 \choose 2}}</math>, and the probability that Terry chooses t
  2 KB (330 words) - 13:42, 1 January 2015
• 2004 AIME II Problems/Problem 1
  == Problem == [[Image:2004 AIME II Problem 1.png]]
  2 KB (329 words) - 23:20, 4 July 2013
• 2004 AIME II Problems
  {{AIME Problems|year=2004|n=II}} == Problem 1 ==
  9 KB (1,410 words) - 05:05, 20 February 2019
• 2003 AIME II Problems
  {{AIME Problems|year=2003|n=II}} == Problem 1 ==
  7 KB (1,127 words) - 09:02, 11 July 2023

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)