Mathematical and Physical Journal
for High Schools
Issued by the MATFUND Foundation
Already signed up?
New to KöMaL?

Problem A. 402. (May 2006)

A. 402. Two players play the following game: Let n be a fixed integer greater than 1. Starting from number k=2, each player has two possible moves: either replace the number k by k+1 or by 2k. The player who is forced to write a number greater than n loses the game. Which player has a winning strategy for which n?

Vojtech Jarnik Competition,Ostrava, 2006

(5 pont)

Deadline expired on June 15, 2006.


16 students sent a solution.
5 points:Erdélyi Márton, Estélyi István, Hujter Bálint, Jankó Zsuzsanna, Kisfaludi-Bak Sándor, Korándi Dániel, Kutas Péter, Nagy 224 Csaba, Paulin Roland, Rutai richárd, Tomon István, Ureczky Bálint.
4 points:Fischer Richárd, Gyenizse Gergő.
2 points:1 student.
1 point:1 student.

Problems in Mathematics of KöMaL, May 2006