Find the largest remainder that can be left over when dividing the number by a three-digit natural number.
Solution
If then dividing by gives quotient and remainder . Obviously the remainder increases when decreases. Thus in the case we obtain the largest remainder .
Dividing by gives remainder . Dividing by or any smaller number gives remainder that does not exceed . Consequently, the largest remainder under the given conditions is .
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.