Skip to content / Đến nội dung
ThichHocToan.com

IMSO 2005 Mathematics — Taiwan Selection Essay Question 8

IMSO Maths · IMSO 2005 Mathematics — Taiwan Selection Essay

Question 8

Two players take it in turns to choose from 25 numbered counters, each labeled with a different odd number from 1 to 49. When one player chooses a counter labeled X, the next player must choose the counter whose label is the greatest odd factor of $99-X$. No matter what the first counter be taken, what is the least number of counters will remain when the game ends?