Maths Olympiad Prep

Library / NMO Selection Tests for BMO and IMO /29 of 47

NMO Selection Tests for BMO and IMO

Number theory Difficulty 8.3 Shortlist Prove it Romania

Let DD be a non-empty set of positive integers, let dd be the greatest common divisor of DD, and let dZ={dn:n∈Z}d\mathbb{Z} = \{dn : n \in \mathbb{Z}\}. Prove that there exists a bijection f:Z→dZf: \mathbb{Z} \to d\mathbb{Z} such that ∣f(n)−f(n−1)∣|f(n) - f(n-1)| is a member of DD for all integers nn.
Amer. Math. Monthly

Solution

Reduce the problem to the case where DD is finite, by considering an element d0d_0 of DD, representing each residue class in D(modd0)D \pmod{d_0} by some member of DD, and collecting all these representatives to form a finite subset of DD whose greatest common divisor is again dd.

Assume henceforth DD finite and induct on the cardinality of DD. The base case ∣D∣=1|D| = 1 being clear, let ∣D∣>1|D| > 1, fix a member aa of DD, notice that D′=D∖{a}D' = D \setminus \{a\} is non-empty since ∣D∣>1|D| > 1, and let d′d' be the greatest common divisor of D′D'. Clearly, dd is the greatest common divisor of aa and d′d', and k=d′/dk = d'/d is integral. By the induction hypothesis, there exists a bijection f′:Z→d′Zf': \mathbb{Z} \to d'\mathbb{Z} such that ∣f′(n)−f′(n−1)∣|f'(n) - f'(n-1)| is a member of D′D' for all integers nn.

It is easily seen that every multiple of dd can uniquely be written in the form
ar+d′s,(∗) ar + d's, \qquad (*)
where rr and ss are both integral and 0≤r<k0 \le r < k.

Assign every integer nn an integer f(n)f(n) in dZd\mathbb{Z} by writing n=kq+rn = kq + r, where qq and rr are both integral and 0≤r<k0 \le r < k, and letting
f(n)={f′(q)+ar,if q is even,f′(q)+a(k−r−1),if q is odd. f(n) = \begin{cases} f'(q) + ar, & \text{if } q \text{ is even,} \\ f'(q) + a(k - r - 1), & \text{if } q \text{ is odd.} \end{cases}
This defines a function f:Z→dZf: \mathbb{Z} \to d\mathbb{Z}.

Since every member of dZd\mathbb{Z} can be written in the form (∗)(*), and f′f' is surjective, so is ff.
Uniqueness in (∗)(*) and injectivity of f′f' imply injectivity of ff, so ff is bijective.
Finally, the fact that ∣f(n)−f(n−1)∣|f(n) - f(n-1)| is a member of DD for all integers nn follows from the corresponding condition for f′f'. Verifications are routine and hence omitted.

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

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.