Maths Olympiad Prep

Track / Stage 6 / 91 of 400 #1091 of 1964

Problem 1091

National olympiad, first round
Number theory Difficulty 6.1 Prove it

Natural numbers pp and qq are coprime. The segment [0,1][0,1] is divided into p+qp+q equal segments.

Prove that in each of these segments, except for the two extreme ones, there lies exactly one of the p+q2p+q-2 numbers 1/p,2/p,{ }^{1} / p,{ }^{2} / p, \ldots, p1/p,1/q,2/q,,q1/qp-1 / p, 1 / q,{ }^{2} / q, \ldots,{ }^{q-1 / q}.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

Due to the mutual simplicity of pp and qq, the specified p+q2p+q-2 numbers are pairwise distinct (in addition, they are different from numbers of the form k/p+qk / p+q). Therefore, they divide the segment [0,1][0,1] into p+q1p+q-1 segments. It is sufficient to prove that within each of these segments there is a point of the form k/p+qk / p+q.

On a segment of the form [m/p,m+1/p]\left[{ }^{m} / p,{ }^{m+1} / p\right], such a point clearly exists, since its length is greater than 1/p+q1 / p+q. Consider a segment of the form [m/p,n/q]\left[{ }^{m} / p,{ }^{n} / q\right]. It contains the point m+n/p+q{ }^{m+n} / p+q, since the inequalities m/p<m+n/p+q<n/q{ }^{m / p}<{ }^{m+n} / p+q<n / q are equivalent to the inequality mq<npm q<n p, which is the inequality m/p<n/qm / p<n / q. Similarly, segments of the form [a/q,b/p]\left[{ }^{a} / q,{ }^{b} / p\right] are considered. Send a comment

Problem 60520 Topics:
[  Diophantine Equations ]\underline{\text { Diophantine Equations }}]Difficulty: 44-
[[ GCD and LCM. Mutual simplicity ]]Classes: 9,10

Prove that if (a1,a2,,an)=1\left(a_{1}, a_{2}, \ldots, a_{n}\right)=1, then the equation a1x1+a2x2++anxn=1a_{1} x_{1}+a_{2} x_{2}+\ldots+a_{n} x_{n}=1 is solvable in integers.

## Hint

By induction, it is not difficult to prove a stronger statement: the equation a1x1+a2x2++anxn=(a1,a2,,an)a_{1} x_{1}+a_{2} x_{2}+\ldots+a_{n} x_{n}=\left(a_{1}, a_{2}, \ldots, a_{n}\right) is solvable in integers. For this, one must use problem 60521\underline{60521} b).

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.