Given some positive integers less than $1951$, where each two have a lowest common multiple greater than $1951$. We need to show that sum of the reciprocals of these numbers is less than $2$
I don't have any work of mine to show on this problem, i have no idea where to start.
I'd appreciate any hints on how to progress upon this
Best Answer
Hint: Here's the high-level idea:
Create a well-defined "function" $f: \{ 1, 2, \ldots 1951\} \rightarrow \{ a_1, a_2, \ldots a_n \}$.
It is a "function" because not all $n$ need to map to an $a_i$.
The preimage of $a_i$ has $\approx \frac{1951}{a_i}$ terms.
The sum of the sizes of the preimage is less than the domain of the "function".
This gives us an upper bound on $ \sum \approx \frac{1951}{a_i} $, which is close to what the question is asking for. We just have to massage it enough to get the actual upper bound.
With this in mind, what function should we try?
2:
1: We verify that this mapping works
3:
Notes