Here is a proof. Unfortunately, the proof is not constructive.The
secret of winning is "1", which is a fator of every integer.
If the first player(player A) can win by removing a number between 2
to n, then our hypothesis holds. Or else, A can't win by removing any
number between 2 to n. We denot
Here is a proof. Unfortunately, the proof is not constructive.The secret of
winning is "1", which is a fator of every integer.
If the first player(player A) can win by removing a number between 2 to n,
then our hypothesis holds. Or else, A can't win by removing any number
between 2 to n. We denote
