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

Page title matches

• 2004 AIME II Problems/Problem 10
  == Problem == {{AIME box|year=2004|n=II|num-b=9|num-a=11}}
  8 KB (1,283 words) - 19:19, 8 May 2024

Page text matches

• Casework
  ..., 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
• 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 == ...he squares <math>0, 1, 2, 3, ... 2^{k} - 1</math>. In this case <math>k = 10</math>, but we will consider more generally to find an inductive solution.
  6 KB (899 words) - 20:58, 12 May 2022
• 2004 AIME II Problems/Problem 14
  == Problem == ...math>, but substituting into our original equation we find that <math>a = -10</math>, so it is invalid). In particular, this invalidates the values of <m
  11 KB (1,857 words) - 12:57, 18 July 2024
• 2004 AIME II Problems/Problem 11
  == Problem == {{AIME box|year=2004|n=II|num-b=10|num-a=12}}
  2 KB (268 words) - 22:20, 23 March 2023
• 2004 AIME II Problems/Problem 9
  == Problem == ...equence]] of positive integers with <math> a_1=1 </math> and <math> a_9+a_{10}=646 </math> is formed so that the first three terms are in [geometric prog
  3 KB (535 words) - 22:25, 5 March 2025
• 2004 AIME II Problems/Problem 7
  == Problem == defaultpen(linewidth(0.7)+fontsize(10));
  9 KB (1,500 words) - 20:06, 8 October 2024
• 2004 AIME II Problems/Problem 5
  ==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
• 2004 AIME II Problems/Problem 4
  == Problem == How many [[positive integer]]s less than 10,000 have at most two different [[digit]]s?
  3 KB (508 words) - 01:16, 19 January 2024
• 2004 AIME II Problems/Problem 2
  == Problem == A jar has <math>10</math> red candies and <math>10</math> blue candies. Terry picks two candies at random, then Mary picks two
  2 KB (330 words) - 13:42, 1 January 2015
• 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
• Mock AIME 2 Pre 2005 Problems
  == 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
• 2020 AIME II Problems/Problem 14
  ==Problem== Hence, <cmath>N = \frac{2005 \cdot 2004 \cdot 2003}{3 \cdot 2\cdot 1} \equiv \boxed{010} (\mathrm{mod} \hskip .2cm
  7 KB (1,187 words) - 05:58, 3 February 2025
• Mathboy282
  [[2019 AIME II Problems/Problem 15]] Solution 5 [[2023 USAJMO Problems/Problem 6]] Solution 1
  10 KB (1,116 words) - 12:37, 11 June 2024

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