Skip to main content
OlympiadHQ

Browse · MathNet

Print

65th Czech and Slovak Mathematical Olympiad

Czech Republic number theory

Problem

Let be a prime. Find the number of ordered sextuples of positive integers, whose sum is , and all the fractions are integers.
Solution
Taking the product of the 1st, the 3rd and the 5th fractions reveals that their value has to be 1, that is the form of the second and of the fourth fraction implies that is first is at most the arithmetic mean of its multiples, and Thus divides and is in the interval . Consequently either or . We deal separately with these cases.

i) Let . Because of (3) there is , which together with (1) gives solutions of the form

ii) Let . Then .

Firstly let and . According to (1) then and , and (2) has the form In analyzing (4) we distinguish between and .

If then and (4) reads While the right relation always holds, the left one holds only for ( is a suitable positive integer). For such prime numbers we get considering (1) solutions If we show first, that the right relation in (4) is satisfied if and only if or . namely implies , thus and . From and we get a . Since , the left relation in (4) is fulfilled and is a solution.

Finally and . In this case a , and (2) reads Because the right relation in (5) holds if and only if , that is iff . Together with we get and , thus the right relation in (5) holds as well, and the last solution is

Conclusion. All the solutions found are apparently mutually different and their number depends on modulo (): If then there are sextuples, if , there are sextuples.
Final answer
p + 2 if p ≡ 1 (mod 3); p + 1 if p ≡ 2 (mod 3)

Techniques

Prime numbersFactorization techniquesModular Arithmetic