2003 AIME II Problems/Problem 2

Problem

Let $N$ be the greatest integer multiple of 8, no two of whose digits are the same. What is the remainder when $N$ is divided by 1000?

Solution

We want a number with no digits repeating, so we can only use the digits $0-9$ once in constructing our number. To make the greatest number, we want the greatest digit to occupy the leftmost side and the least digit to occupy the rightmost side. Therefore, the last three digits of the greatest number should be an arrangement of the digits $0,1,2$ . Since the number has to be divisible by 8, the integer formed by the arrangement of $0,1,2$ is also divisible by 8. The only arrangement that works is $120$ .

Therefore, the remainder when the number is divided by $1000$ is $\boxed{120}$ .

2003 AIME II (Problems • Answer Key • Resources)
Preceded by Problem 1	Followed by Problem 3
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

Page

Toolbox

Search

2003 AIME II Problems/Problem 2

Problem

Solution

See also