UKMT Intermediate Challenge-III

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?


The answer is 671.

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.

1 solution

If the divisor is not limited, then the largest remainder will 2015 2 = 1007 \left \lfloor \dfrac {2015} {2} \right \rfloor = 1007 because 2015 = 1007 + 1008 2015 = 1007+1008 and 2015 1007 ( m o d 1008 ) 2015 \equiv 1007 \pmod{1008} . But 1008 > 1000 1008> 1000 therefore the answer is unacceptable.

The next largest remainder is given by 2015 3 = 671 \left \lfloor \dfrac {2015} {3} \right \rfloor = 671 because 2015 = 671 + 2 ( 672 ) 2015 = 671+2(672) and 2015 671 ( m o d 672 ) 2015 \equiv 671 \pmod{672} and 672 < 1000 672<1000 . Therefore the answer is 671 \boxed{671} .

Very elegant solution sir !

Venkata Karthik Bandaru - 6 years, 2 months ago

But 1008=2*504,so, when devide 2015 by 504 then the remainder is 1007 which is bigger than 671.

Tarit Goswami - 4 years ago

Log in to reply

Ohh, ok then 671 is biggest.

Tarit Goswami - 4 years ago

Log in to reply

Good solution!

Tarit Goswami - 4 years ago

If the divisor is not limited, the largest remainder is actually 2015 itself. This largest remainder is obtained when 2015 is divided by any number greater than 2015.

asdfg qwerty - 11 months, 2 weeks ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...