« Vrati se
On a blackboard there are n \geq 2, n \in \mathbb{Z}^{+} numbers. In each step we select two numbers from the blackboard and replace both of them by their sum. Determine all numbers n for which it is possible to yield n identical number after a finite number of steps.

Slični zadaci

#NaslovOznakeRj.KvalitetaTežina
1959IMO Shortlist 1997 problem 30
2401skakavac 2012 prvo kolo ss3 20
2415MEMO 2008 pojedinačno problem 27
2511skakavac 2012 trece kolo ss1 23
2522brojevi u krugu5
25233 hrpe novcica5