Browse · MathNet
PrintEstonian Math Competitions
Estonia counting and probability
Problem
Little Juku writes all integers from to on a blackboard, but as he does not know the digit yet, he skips all numbers that contain . Juku's sister Mari erases two numbers on the blackboard and writes the absolute value of the difference of these numbers on the blackboard. Then Mari again erases two numbers on the blackboard and writes the absolute value of their difference on the blackboard, etc. Can it happen after a finite number of such steps that there are all integers from to that contain the digit and only these on the blackboard, each one exactly once, if
a. ;
b. ?
a. ;
b. ?
Solution
Answer: (a) No; (b) No.
a. The difference and the sum of two integers have equal parity, likewise are an integer and its absolute value of equal parity. Thus Mari's every step keeps the parity of the sum of all numbers on the blackboard unchanged. Among , there are odd numbers. As is odd itself, the sum of all numbers is odd. This implies that the sum of all integers from to that contain and the sum of integers from to that do not contain have different parities. Hence the set of all natural numbers from to that contain can never appear on the blackboard.
b. Let there be positive integers from to that do not contain . Then there are positive integers from to that contain . As each Mari's step decreases the number of numbers on the blackboard by , she should make or, equivalently, steps to reach the desired state. As only one new number can appear at each step, introducing new numbers assumes which is equivalent to . But there are only numbers among the first positive integers that do not contain ; since , achieving the desired state is impossible.
a. The difference and the sum of two integers have equal parity, likewise are an integer and its absolute value of equal parity. Thus Mari's every step keeps the parity of the sum of all numbers on the blackboard unchanged. Among , there are odd numbers. As is odd itself, the sum of all numbers is odd. This implies that the sum of all integers from to that contain and the sum of integers from to that do not contain have different parities. Hence the set of all natural numbers from to that contain can never appear on the blackboard.
b. Let there be positive integers from to that do not contain . Then there are positive integers from to that contain . As each Mari's step decreases the number of numbers on the blackboard by , she should make or, equivalently, steps to reach the desired state. As only one new number can appear at each step, introducing new numbers assumes which is equivalent to . But there are only numbers among the first positive integers that do not contain ; since , achieving the desired state is impossible.
Final answer
(a) No; (b) No
Techniques
Invariants / monovariantsIntegers