Problem arises due overuse of magic - Part (1)

Ben plays a game: He writes the numbers from 1 to 2004 on a board, selects n n numbers, then writes their sum s m o d 11 s \bmod {11} on the board, casts a magic chant, so that the previous n n selected numbers vanish from the board and starts over again with the numbers, which are left at the board.

  • selecting n n numbers,
  • writing down the s m o d 11 s \bmod { 11 } ,
  • making the previous n n numbers vanish.

At the end there were just two numbers left. One was 1000. What was the other one?


The answer is 4.

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

Dharampal Mahla
Jul 29, 2015

s mod 11 = the remainder when 's' is divided by 11

now the sum of 1 to 2004 = 2009010 (sum of AP)

we know that one no. is 1000 so the remaining sum = 2008010

as we know the remainder can not exceeds 10 it means the missing no. is the

remainder of the remaining sum (2008010) when it is divided by 11

and it's 4

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...