2000 AMC 12 Problems/Problem 1
From AoPSWiki
(Redirected from 2000 AMC 10 Problems/Problem 1)
- The following problem is from both the 2000 AMC 12 #1 and 2000 AMC 10 #1, so both problems redirect to this page.
Problem
In the year 
, 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 
?
Solution
The sum is the highest if two factors are the lowest.
So, 
and 
.
See Also
| 2000 AMC 12 (Problems • Resources) | ||
| Preceded by First Question | Followed by Problem 2 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
| 2000 AMC 10 (Problems • Resources) | ||
| Preceded by First Question | Followed by Problem 2 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
