Bogdan divides 2015 successively by 1, 2, 3, ..., all the way up to include 1000. He writes down the remainder for each division. What is the largest remainder he writes down?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
If the divisor is not limited, then the largest remainder will ⌊ 2 2 0 1 5 ⌋ = 1 0 0 7 because 2 0 1 5 = 1 0 0 7 + 1 0 0 8 and 2 0 1 5 ≡ 1 0 0 7 ( m o d 1 0 0 8 ) . But 1 0 0 8 > 1 0 0 0 therefore the answer is unacceptable.
The next largest remainder is given by ⌊ 3 2 0 1 5 ⌋ = 6 7 1 because 2 0 1 5 = 6 7 1 + 2 ( 6 7 2 ) and 2 0 1 5 ≡ 6 7 1 ( m o d 6 7 2 ) and 6 7 2 < 1 0 0 0 . Therefore the answer is 6 7 1 .