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.

Which one of the following CANNOT be the number finally left?

Solution

✅ Correct Option: 3

Replacing aa and bb by ∣a−b∣|a-b| changes the total sum by

(a+b)−∣a−b∣=2min⁡(a,b)(a+b)-|a-b|=2\min(a,b),

which is always even.

So the parity of the total sum never changes.

Initially,

1+2+⋯+20=2101+2+\cdots+20=210,

which is even.

When only one number remains, that number must therefore be even.

Among the options, 7 is odd, so it 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