Browse · MathNet
PrintEstonian Math Competitions
Estonia number theory
Problem
Let be a fixed prime number. Juku and Miku play the following game. One of the players chooses a natural number such that and is not divisible by , his opponent chooses any natural number such that . Miku wins if the natural number written as ones in the positional numeral system with radix is divisible by , otherwise Juku wins. Which player has a winning strategy if:
a. Juku chooses the number , tells it to Miku and then Miku chooses the number ;
b. Juku chooses the number , tells it to Miku and then Miku chooses the number ?
a. Juku chooses the number , tells it to Miku and then Miku chooses the number ;
b. Juku chooses the number , tells it to Miku and then Miku chooses the number ?
Solution
Answer: (a) Miku; (b) Juku.
The positional representation with radix consisting of ones denotes the sum which equals .
a. Let . If or then, by the lifting-the-exponent lemma, the exponent of the prime in the canonical representation of equals that in the canonical representation of . Thus to win, Miku may choose any number that is divisible by . If and then the exponent of the prime 2 in the canonical representation of is 1, while that in the canonical representation of is larger as . Thus to win, Miku may choose .
Let now . By Fermat's little theorem, . Hence whenever is a multiple of . Then the numerator of the fraction is divisible by while the denominator is not, whence the value of the fraction is divisible by . Consequently, Miku can win by choosing any multiple of greater than 1 as .
b. We show that Juku wins by choosing . Let be the number chosen by Miku.
Let . If or then, by the lifting-the-exponent lemma, the exponent of in the canonical representation of equals that in the canonical representation of . As does not divide , it does not divide either. If and then , whence 2 does not divide . Therefore 2 does not divide .
Let now . By Fermat's little theorem, and , giving . Thus . As does not divide the numerator of the fraction , it cannot divide the value of the fraction either.
The positional representation with radix consisting of ones denotes the sum which equals .
a. Let . If or then, by the lifting-the-exponent lemma, the exponent of the prime in the canonical representation of equals that in the canonical representation of . Thus to win, Miku may choose any number that is divisible by . If and then the exponent of the prime 2 in the canonical representation of is 1, while that in the canonical representation of is larger as . Thus to win, Miku may choose .
Let now . By Fermat's little theorem, . Hence whenever is a multiple of . Then the numerator of the fraction is divisible by while the denominator is not, whence the value of the fraction is divisible by . Consequently, Miku can win by choosing any multiple of greater than 1 as .
b. We show that Juku wins by choosing . Let be the number chosen by Miku.
Let . If or then, by the lifting-the-exponent lemma, the exponent of in the canonical representation of equals that in the canonical representation of . As does not divide , it does not divide either. If and then , whence 2 does not divide . Therefore 2 does not divide .
Let now . By Fermat's little theorem, and , giving . Thus . As does not divide the numerator of the fraction , it cannot divide the value of the fraction either.
Final answer
a) Miku; b) Juku
Techniques
Fermat / Euler / Wilson theoremsPrime numbersGames / greedy algorithms