Olympiad Maths Prep

Track / Stage 7 / 57 of 300 #1457 of 2000

Problem 1457

National olympiad second round; IMO P1/P4
Number theory Difficulty 7.1 Prove it

Let uku_k be a sequence of integers, and let VnV_n be the number of those which are less than or equal to nn. Show that if
k=11uk<,\sum_{k=1}^{\infty} \frac{1}{u_k } < \infty,
then
limnVnn=0.\lim_{n \to \infty} \frac{ V_{n}}{n}=0.

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

1. Understanding the Problem:
We are given a sequence of integers uk u_k and a function Vn V_n which counts the number of terms in the sequence uk u_k that are less than or equal to n n . We need to show that if the series k=11uk \sum_{k=1}^{\infty} \frac{1}{u_k} converges, then the limit of Vnn \frac{V_n}{n} as n n approaches infinity is zero.

2. Assumption and Goal:
We assume that k=11uk< \sum_{k=1}^{\infty} \frac{1}{u_k} < \infty . Our goal is to show that limnVnn=0 \lim_{n \to \infty} \frac{V_n}{n} = 0 .

3. Using the Convergence of the Series:
Since k=11uk \sum_{k=1}^{\infty} \frac{1}{u_k} converges, for any ε>0 \varepsilon > 0 , there exists an integer N N such that for all nN n \geq N , the sum of the reciprocals of uk u_k with n<uk2n n < u_k \leq 2n is less than ε \varepsilon . This is because the tail of a convergent series can be made arbitrarily small.

4. Bounding the Number of Terms:
Consider the terms uk u_k such that n<uk2n n < u_k \leq 2n . Each of these terms contributes at least 12n \frac{1}{2n} to the sum. Therefore, if there are V2nVn V_{2n} - V_n such terms, we have:
(V2nVn)12nε (V_{2n} - V_n) \cdot \frac{1}{2n} \leq \varepsilon
Simplifying this inequality, we get:
V2nVn2nε V_{2n} - V_n \leq 2n \varepsilon

5. Summing Dyadically:
We can now sum this inequality over dyadic intervals. For sufficiently large n n , we can write:
V2nVn+2nε V_{2n} \leq V_n + 2n \varepsilon
Repeating this process, we get:
V4nV2n+4nεVn+2nε+4nε=Vn+6nε V_{4n} \leq V_{2n} + 4n \varepsilon \leq V_n + 2n \varepsilon + 4n \varepsilon = V_n + 6n \varepsilon
Continuing this process, we see that for any k k :
V2knVn+(2n+4n+8n++2kn)ε V_{2^k n} \leq V_n + (2n + 4n + 8n + \cdots + 2^k n) \varepsilon
The sum inside the parentheses is a geometric series with sum (2k+12)n (2^{k+1} - 2)n . Therefore:
V2knVn+(2k+12)nε V_{2^k n} \leq V_n + (2^{k+1} - 2)n \varepsilon

6. Taking the Limit:
Dividing both sides by 2kn 2^k n , we get:
V2kn2knVn2kn+(2k+12)nε2kn=Vn2kn+2ε2ε2k \frac{V_{2^k n}}{2^k n} \leq \frac{V_n}{2^k n} + \frac{(2^{k+1} - 2)n \varepsilon}{2^k n} = \frac{V_n}{2^k n} + 2 \varepsilon - \frac{2 \varepsilon}{2^k}
As k k \to \infty , the term Vn2kn \frac{V_n}{2^k n} approaches zero, and we are left with:
limkV2kn2kn2ε \lim_{k \to \infty} \frac{V_{2^k n}}{2^k n} \leq 2 \varepsilon
Since ε>0 \varepsilon > 0 was arbitrary, we conclude that:
limnVnn=0 \lim_{n \to \infty} \frac{V_n}{n} = 0
This completes the proof.

\blacksquare

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