Write the numbers 1,2,...,2n on a blackboard, where n is an odd integer. Pick any two of the numbers, j and k, write |j ‒ k| on the board and erase j and k. Continue this process until only one integer is written on the board. Prove that this integer must he odd.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.