Problem #PRU-86522

Problems Methods Divisibility Division with remainders. Arithmetic of remainders Division with remainder Number Theory Pigeonhole principle Pigeonhole principle (other)
 13–14  3.0

Problem

Prove that amongst the numbers of the form \[19991999\dots 19990\dots 0\] – that is 1999 a number of times, followed by a number of 0s – there will be at least one divisible by 2001.