2015 AIME II Problem 1

Attempt Problem 1 of the 2015 AIME II below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2015 AIME II solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

1.

Let NN be the least positive integer that is both 2222 percent less than one integer and 1616 percent greater than another integer. Find the remainder when NN is divided by 1000.1000.

Answer: 131
Concepts:percentagedivisibilityleast common multiple
Difficulty rating: 2050
Small Hint:

Write N=78100a=116100bN = \frac{78}{100}a = \frac{116}{100}b and reduce both fractions to lowest terms

Big Hint:

In lowest terms N=3950a=2925b,N = \frac{39}{50}a = \frac{29}{25}b, which forces NN to be a multiple of both 3939 and 2929

Solution:

The conditions say N=78100a=3950aN = \frac{78}{100}a = \frac{39}{50}a and N=116100b=2925bN = \frac{116}{100}b = \frac{29}{25}b for some integers aa and b.b. Since gcd(39,50)=1,\gcd(39, 50) = 1, the first equation forces aa to be divisible by 50,50, so NN is a multiple of 39;39; since gcd(29,25)=1,\gcd(29, 25) = 1, the second forces bb to be divisible by 25,25, so NN is a multiple of 29.29.

The least positive integer divisible by both is N=3929=1131,N = 39 \cdot 29 = 1131, achieved with a=1450a = 1450 and b=975.b = 975. The remainder upon division by 10001000 is 131.131.

Full Exam

Problem 1 in Other Years