Create the page "2000 AIME 1 Problems/Problem 15" on this wiki! See also the search results found.

• 2000 AIME II
  ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2000 AIME II Problems]]
  1 KB (139 words) - 08:41, 7 September 2011
• 2001 AIME I
  ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2001 AIME I Problems]]
  1 KB (139 words) - 08:41, 7 September 2011
• 2000 AIME I
  ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2000 AIME I Problems]]
  1 KB (135 words) - 18:05, 30 May 2015
• 1999 AIME
  ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[1999 AIME Problems]]
  1 KB (118 words) - 08:41, 7 September 2011
• 1987 AIME Problems
  {{AIME Problems|year=1987}} == Problem 1 ==
  6 KB (869 words) - 15:34, 22 August 2023
• 1992 AIME Problems
  {{AIME Problems|year=1992}} == Problem 1 ==
  8 KB (1,117 words) - 05:32, 11 November 2023
• 1999 AIME Problems
  {{AIME Problems|year=1999}} == Problem 1 ==
  7 KB (1,094 words) - 13:39, 16 August 2020
• 2000 AIME I Problems
  {{AIME Problems|year=2000|n=I}} == Problem 1 ==
  7 KB (1,204 words) - 03:40, 4 January 2023
• 2001 AIME I Problems
  {{AIME Problems|year=2001|n=I}} == Problem 1 ==
  7 KB (1,220 words) - 14:05, 24 November 2024
• 2000 AIME II Problems
  {{AIME Problems|year=2000|n=II}} == Problem 1 ==
  6 KB (947 words) - 21:11, 19 February 2019
• 1989 AIME Problems/Problem 11
  == Problem == A sample of 121 [[integer]]s is given, each between 1 and 1000 inclusive, with repetitions allowed. The sample has a unique [[mod
  5 KB (851 words) - 18:01, 28 December 2022
• 1989 AIME Problems/Problem 6
  == Problem == 0 &= 15t^2 - 800t + 10000 = 3t^2 - 160t + 2000\
  6 KB (980 words) - 15:08, 14 May 2024
• 2000 AIME I Problems/Problem 14
  == Problem == ...20*dir(75),p); MP("x",P,17*dir(245),p); MP("2x",Q,15*dir(70),p); MP("2x",A,15*dir(-90),p); MP("2y",P,2*left,p); MP("3x",P,10*dir(-95),p); MP("x+y",C,5*di
  9 KB (1,505 words) - 23:17, 31 December 2024
• 2000 AIME I Problems/Problem 11
  == Problem == == Solution 1 ==
  6 KB (867 words) - 12:49, 17 November 2024
• 2000 AIME I Problems/Problem 5
  == Problem == == Solution 1==
  7 KB (1,011 words) - 20:09, 4 January 2024
• 2000 AIME I Problems/Problem 2
  == Problem == === Solution 1 ===
  4 KB (735 words) - 14:31, 22 October 2024
• 2000 AIME II Problems/Problem 14
  == Problem == ...1984!+2000!</math>, find the value of <math>f_1-f_2+f_3-f_4+\cdots+(-1)^{j+1}f_j</math>.
  9 KB (1,398 words) - 00:34, 21 January 2025
• 2000 AIME II Problems/Problem 12
  == Problem == ...</math>. It is given that <math>AB=13</math>, <math>BC=14</math>, <math>CA=15</math>, and that the distance from <math>O</math> to <math>\triangle ABC</m
  4 KB (628 words) - 16:27, 20 January 2025
• 2000 AIME II Problems/Problem 7
  == Problem == ...5!14!}+\frac 1{6!13!}+\frac 1{7!12!}+\frac 1{8!11!}+\frac 1{9!10!}=\frac N{1!18!}</math></center> find the [[floor function|greatest integer]] that is l
  2 KB (281 words) - 12:09, 5 April 2024
• 2009 AIME II Problems
  {{AIME Problems|year=2009|n=II}} == Problem 1 ==
  8 KB (1,366 words) - 13:59, 24 June 2024

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