
Problem of the Week
Problem
D and Solution
It’s
Still Five
Problem
When an integer, , is divided
by , , or , the remainder is . If , what is the smallest possible
value of ?
Solution
Solution 1
When is divided by , , or , the remainder is This means that is divisible by each of , , and Since is divisible by each of , , and , then is divisible by the least common
multiple of , , and
Since , , and is prime, then to find the least
common multiple, we calculate the product of the highest powers of each
of the prime factors that occur in the given numbers. It follows that
the least common multiple of ,
, and is
Since and , we can conclude that . Since is divisible by , then the smallest possible value for
is . Then
Solution 2
When is divided by , , or , the remainder is This means that is divisible by each of , , and Since is divisible by and , then must be divisible by the least common
multiple of and , which is We test the first few multiples of
until we obtain one that is
divisible by
The integers , , , , and are not divisible by , but is. Therefore, is divisible by Since and , we can conclude that Therefore, the smallest possible
value for is Then