Difference between revisions of "2000 AMC 12 Problems"
Silverfalcon (talk | contribs) (→Problem 4) |
Silverfalcon (talk | contribs) (→Problem 1) |
||
| Line 1: | Line 1: | ||
== Problem 1 == | == Problem 1 == | ||
| − | In the year 2001, the United States will host the International Mathematical Olympiad. Let <math>I,M,</math> and <math>O</math> be distinct positive integers such that the product <math>I \cdot M \cdot O = 2001 </math>. What is the largest possible value of the sum <math>I + M + O</math>? | + | In the year 2001, the United States will host the International Mathematical Olympiad. Let <math> \displaystyle I,M,</math> and <math>\displaystyle O</math> be distinct positive integers such that the product <math>I \cdot M \cdot O = 2001 </math>. What is the largest possible value of the sum <math>I + M + O</math>? |
<center><math> \mathrm{(A) \ 23 } \qquad \mathrm{(B) \ 55 } \qquad \mathrm{(C) \ 99 } \qquad \mathrm{(D) \ 111 } \qquad \mathrm{(E) \ 671 } </math></center> | <center><math> \mathrm{(A) \ 23 } \qquad \mathrm{(B) \ 55 } \qquad \mathrm{(C) \ 99 } \qquad \mathrm{(D) \ 111 } \qquad \mathrm{(E) \ 671 } </math></center> | ||
Revision as of 18:50, 4 July 2006
Contents
- 1 Problem 1
- 2 Problem 2
- 3 Problem 3
- 4 Problem 4
- 5 Problem 5
- 6 Problem 6
- 7 Problem 7
- 8 Problem 8
- 9 Problem 9
- 10 Problem 10
- 11 Problem 11
- 12 Problem 12
- 13 Problem 13
- 14 Problem 14
- 15 Problem 15
- 16 Problem 16
- 17 Problem 17
- 18 Problem 18
- 19 Problem 19
- 20 Problem 20
- 21 Problem 21
- 22 Problem 22
- 23 Problem 23
- 24 Problem 24
- 25 Problem 25
- 26 See also
Problem 1
In the year 2001, the United States will host the International Mathematical Olympiad. Let 
and 
be distinct positive integers such that the product 
. What is the largest possible value of the sum 
?
Problem 2
Problem 3
Each day, Jenny ate 20% of the jellybeans that were in her jar at the beginning of that day. At the end of the second day, 32 remained. How many jellybeans were in the jar originally?
Problem 4
The Fibonacci sequence 1,1,2,3,5,8,13,21,... starts with two 1s, and each term afterwards is the sum of its two predecessors. Which one of the ten digits is the last to appear in the units position of a number in the Fibonacci sequence?
