Skip to main contentSkip to solution

The numbers 1,2,3,…,201,2,3,\ldots,20 are written on a board.

A move is made as follows: choose any two numbers currently on the board, rub out both of them, and write one new number equal to the larger number minus the smaller number.

Every move leaves the board with one number fewer. The process continues until only one number remains.

Suppose instead that the numbers written on the board at the start are 3,6,9,…,603,6,9,\ldots,60, the first twenty multiples of 3. The same moves are then made until one number is left. Which one of the following CANNOT be the number finally left?

Solution

✅ Correct Option: 1

Every starting number is divisible by 3, and the difference of two multiples of 3 is also a multiple of 3. So every number that ever appears remains divisible by 3.

Also, the parity of the total sum is unchanged.

The initial sum is

3(1+2+⋯+20)=3(210)=6303(1+2+\cdots+20)=3(210)=630,

which is even.

Hence the final number must be both:

  • divisible by 33;
  • even.

So it must be a multiple of 66.

Among the options, 45 is not even and therefore cannot be the final number.

Keyboard Shortcuts

  • Left arrow: Previous question
  • Right arrow: Next question
  • S key: Jump to solution
  • Q key: Jump to question