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

• Casework
  ..., then adding together the totals of each part. Casework is a very general problem-solving approach, and as such has wide applicability. ...emonstrate casework in action. Unlike the selections in this article, most problems cannot be completely solved through casework. However, it is crucial as an
  5 KB (709 words) - 17:40, 24 September 2024
• Prime factorization
  * Note that <math>11</math> is not a factor of <math>151</math>, so we can move on. In fact, be ==Problems==
  3 KB (496 words) - 22:14, 5 January 2024
• Complex number
  ...numbers''' arise when we try to solve [[equation]]s such as <math> x^2 = -1 </math>. ...this addition, we are not only able to find the solutions of <math> x^2 = -1 </math> but we can now find ''all'' solutions to ''every'' polynomial. (Se
  5 KB (860 words) - 15:36, 10 December 2023
• 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 6
  == Problem == 0 &= 15t^2 - 800t + 10000 = 3t^2 - 160t + 2000\
  6 KB (980 words) - 15:08, 14 May 2024
• 1998 AIME Problems/Problem 8
  == Problem == | 0 || 1 || 2 || 3 || 4 || 5 || 6
  2 KB (354 words) - 13:19, 14 December 2024
• 2000 AIME I Problems/Problem 12
  == Problem == ...argest number of different values that can appear in the list <math>f(0),f(1),f(2),\ldots,f(999)?</math>
  5 KB (921 words) - 16:36, 28 November 2024
• 2000 AIME I Problems/Problem 10
  == Problem == ...has the property that, for every [[integer]] <math>k</math> between <math>1</math> and <math>100,</math> inclusive, the number <math>x_{k}</math> is <m
  2 KB (319 words) - 22:26, 29 December 2022
• 2000 AIME I Problems/Problem 2
  == Problem == === Solution 1 ===
  4 KB (735 words) - 14:31, 22 October 2024
• 2000 AIME II Problems/Problem 12
  == Problem == == Solution 1==
  4 KB (628 words) - 16:27, 20 January 2025
• 2000 AIME II Problems/Problem 10
  == Problem == == Solution 1==
  2 KB (399 words) - 17:37, 2 January 2024

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