# Let $n\geq a_1 > a_2 > \cdots a_k$ be positive integers such that $\text{lcm}(a_i,a_j)\leq n$. Prove that $ia_i\leq n$ for $i=1,2,\cdots, k$. [closed]

Let $n\geq a_1 > a_2 > \cdots a_k$ be positive integers such that $\text{lcm}(a_i,a_j)\leq n$. Prove that $ia_i\leq n$ for $i=1,2,\cdots, k$.

How do I begin this? (Please provide hints instead of a complete solution. I don't wish to see the solution right now. It would be best if you provide hints and keep the solution inside a spoiler). Maybe we can consider intervals like $[1,\frac{n}{i}]$ and do something.

## closed as off-topic by Saad, Xander Henderson, user99914, Isaac Browne, TaroccoesbroccoJul 13 '18 at 5:52

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Saad, Xander Henderson, Community, Isaac Browne, Taroccoesbrocco
If this question can be reworded to fit the rules in the help center, please edit the question.

One easy way of seeing this is, $\displaystyle a_ia_j = \text{lcm}(a_i,a_j) \times \text{gcd}(a_i,a_j)$ then, $$\text{lcm}(a_i,a_j) = \frac{a_ia_j}{\text{gcd}(a_i,a_j)} \ge \frac{a_ia_j}{a_i - a_j},\, \quad \text{for } 1 \le i < j \le k \text{ (why?)}$$
Then, we may try to estimate $\displaystyle \frac{1}{a_{i+1}} - \frac{1}{a_i}$ ...
Spoiler: (since, $\text{gcd}(a_i,a_j) \vert (a_i - a_j) \implies \text{gcd}(a_i,a_j) \le (a_i - a_j)$). Then, by given condition, $$\frac{1}{a_j} - \frac{1}{a_i} \ge \frac{1}{\text{lcm}(a_i,a_j)} \ge \frac{1}{n}, \forall 1 \le i < j \le k \implies \sum_{i=1}^{j-1} \left(\frac{1}{a_{i+1}} - \frac{1}{a_i}\right) \ge \frac{j-1}{n}$$ Hence, $$\frac{1}{a_j} \ge \frac{j-1}{n} + \frac{1}{a_1} \ge \frac{j}{n}$$ as desired.