Question

You have the numbers 1,
2, 3, ..., 2055 written on a
board. A move consists of
picking a positive integer
k and subtracting k from
all the numbers that are at
least as large as k. What is
the minimum number of
moves required to turn all
the numbers on the board
zero? ​

Answer 1

Answer:

4 is the l answer I think