« Vrati se
All positive divisors of a positive integer N are written on a blackboard. Two players A and B play the following game taking alternate moves. In the firt move, the player A erases N. If the last erased number is d, then the next player erases either a divisor of d or a multiple of d. The player who cannot make a move loses. Determine all numbers N for which A can win independently of the moves of B.

Slični zadaci

#NaslovTagsRj.KvalitetaTežina
2048IMO Shortlist 2000 problem C43
2074IMO Shortlist 2001 problem C48
2102IMO Shortlist 2002 problem C41
2243IMO Shortlist 2007 problem C35
2259IMO Shortlist 2007 problem N36
2440MEMO 2010 ekipno problem 32