Maths Olympiad Prep

Library / /15 of 20

, 2022

Number theory Difficulty 8.6 Shortlist Prove it Germany

Problem:

The greatest common divisor of two positive integers mm and nn shall be denoted by ggT(m,n)\operatorname{ggT}(m, n).
Let an infinite set SS of positive integers be given, such that there exist four pairwise distinct numbers v,w,x,ySv, w, x, y \in S for which ggT(v,w)ggT(x,y)\operatorname{ggT}(v, w) \neq \operatorname{ggT}(x, y) holds.
Prove that there exist three pairwise distinct numbers a,b,cSa, b, c \in S for which ggT(a,b)=ggT(a,c)ggT(b,c)\operatorname{ggT}(a, b)=\operatorname{ggT}(a, c) \neq \operatorname{ggT}(b, c) holds.

Solutions — 2

Solution 1

Solution:

In the following we call a three-element subset {s,t,u}S\{s, t, u\} \subset S a balanced triangle if the set {ggT(s,t),ggT(s,u),ggT(t,u)}\{\mathrm{ggT}(s, t), \operatorname{ggT}(s, u), \operatorname{ggT}(t, u)\} has exactly two distinct elements. It is to be shown that there exists a balanced triangle.

Lemma. For pairwise distinct numbers a,b,c,dSa, b, c, d \in S such that ggT(a,b)=ggT(a,c)ggT(a,d)\operatorname{ggT}(a, b)=\operatorname{ggT}(a, c) \neq \operatorname{ggT}(a, d) and ggT(b,d)=ggT(c,d)\operatorname{ggT}(b, d)=\operatorname{ggT}(c, d) hold, the set {a,b,c,d}\{a, b, c, d\} contains a balanced triangle.

Proof. If ggT(a,b)=ggT(b,d)\operatorname{ggT}(a, b)=\operatorname{ggT}(b, d), then {a,b,d}\{a, b, d\} is a balanced triangle. Otherwise, either ggT(a,d)ggT(a,b)\operatorname{ggT}(a, d) \neq \operatorname{ggT}(a, b) or ggT(a,d)ggT(b,d)\operatorname{ggT}(a, d) \neq \operatorname{ggT}(b, d) holds, so {a,b,c}\{a, b, c\} or {b,c,d}\{b, c, d\} is a balanced triangle.

Figure 1

For every element aSa \in S let Sa={ggT(a,s)sS,sa}S_{a}=\{\operatorname{ggT}(a, s) \mid s \in S, s \neq a\}. Since this set contains only divisors of aa, it is finite. From the hypothesis it follows that we can choose aSa \in S such that SaS_{a} contains at least two elements, since otherwise ggT(v,w)=ggT(w,x)=ggT(x,y)\operatorname{ggT}(v, w)=\operatorname{ggT}(w, x)=\operatorname{ggT}(x, y) would hold.

By the pigeonhole principle we find an infinite subset TST \subset S such that ggT(a,t)\operatorname{ggT}(a, t) is the same value gg for all tTt \in T. Now we choose a dS\(T{a})d \in S \backslash(T \cup\{a\}) such that ggT(a,d)g\operatorname{ggT}(a, d) \neq g, which must exist because of Sa>1\left|S_{a}\right|>1. Since SdS_{d} is also finite, by the pigeonhole principle we find two distinct elements b,cTb, c \in T such that ggT(b,d)=ggT(c,d)\operatorname{ggT}(b, d)=\operatorname{ggT}(c, d) holds. Then a,b,c,da, b, c, d satisfy the hypotheses of the lemma, so indeed a balanced triangle exists.

Solution 2

Solution:

We may assume without loss of generality that no integer g>1g>1 divides all numbers of SS, since otherwise we could choose the largest such number gg and replace SS by the set S={s/gsS}S^{\prime}=\{s / g \mid s \in S\}: if the claim holds for SS^{\prime}, then it also holds for SS.

Suppose that for some prime pp the subset SpSS_{p} \subset S of all numbers divisible by pp were infinitely large, then we choose aS\Spa \in S \backslash S_{p}, which is possible because of the preliminary consideration. Since the numbers ggT(a,s)\operatorname{ggT}(a, s) for sSps \in S_{p} are divisors of cc, by the pigeonhole principle there exist distinct b,cSpb, c \in S_{p} with ggT(a,b)=ggT(a,c)\operatorname{ggT}(a, b)=\operatorname{ggT}(a, c). Since b,cb, c are both divisible by pp, it also follows that ggT(b,c)ggT(a,c)\operatorname{ggT}(b, c) \neq \operatorname{ggT}(a, c), hence the claim.

Thus we may assume that every prime divides only finitely many elements of SS. Because of the hypothesis, we now find numbers b,cSb, c \in S that are not coprime. There are only finitely many primes dividing bb or cc, so SS also contains only finitely many elements that are not coprime to bb or cc. Thus, since S=|S|=\infty, we can choose an element aSa \in S that is coprime to both bb and cc. Then a,b,ca, b, c satisfy the claim.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement translated into English from de; metadata (topic, difficulty) added by this project.