1984 AIME Problem 2

Attempt Problem 2 of the 1984 AIME 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 1984 AIME solutions, or check the answer key.

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

2.

The integer nn is the smallest positive multiple of 1515 such that every digit of nn is either 88 or 0.0. Compute n15.\frac{n}{15}.

Answer: 592
Concepts:divisibilitydigits
Difficulty rating: 1890
Small Hint:

Divisibility by 55 determines the last digit

Big Hint:

Divisibility by 33 restricts the number of digits equal to 88

Solution:

A multiple of 1515 must end in 00 and have digit sum divisible by 3.3. Because 82(mod3),8\equiv2\pmod3, the number of 88’s must be a positive multiple of 3.3. The smallest possible number therefore has three 88’s followed by 0,0, namely n=8880.n=8880. Thus n15=592.\frac{n}{15}=592.

← Problem 1#1
Full Exam

Problem 2 in Other Years