Browse · MathNet
PrintUkrajina 2008
Ukraine 2008 number theory
Problem
There are five piles made of , , , , and stones respectively. You are allowed to do the following: instead of two piles consisting of and stones you can make two piles of and stones; two piles of and stones. You can also choose different piles, in which the total number of stones equals where is some natural number, and create * piles of stones in each one instead. Can we make five piles each of which will consist of a) stones; b) stones in finite number of steps?
Solution
a) We can easily find that the GCD of all the numbers , , , , and is . For every operation you are allowed to perform the number of stones in piles stays divisible by . Therefore the answer is "No" as the number is not divisible by .
b) In the second case the answer is "Yes". One of the ways to obtain the necessary set of piles is as follows: . Now we have a pile of stones and can increase the other pile by stones times: . After that we divide the five derived piles into equal parts, in which the total number of stones equals , and arrive at the desired result.
b) In the second case the answer is "Yes". One of the ways to obtain the necessary set of piles is as follows: . Now we have a pile of stones and can increase the other pile by stones times: . After that we divide the five derived piles into equal parts, in which the total number of stones equals , and arrive at the desired result.
Final answer
a) No; b) Yes
Techniques
Greatest common divisors (gcd)Invariants / monovariants