Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let each of the positive integers $a_1 ,\dots, a_n$ be less than $m$ such that the least common multiple of any two of the positive integers $a_1 ,\dots, a_n$ is greater than the integer $m$.

Then what is the best possible upper bound for $\sum_{j=1}^n\frac 1{a_j}$? (I'm only aware of the upper bound $2$ but perhaps read somewhere that $6/5$ also serve as a bound)

share|cite|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.