0
$\begingroup$

Prove for any integer $n > 2$, one can find n distinct positive integers, such that the sum of their reciprocals is equal to 1.
Is there any non-complicated way to do this? Induction doesn't seem to work, and neither does proof by contradiction. Writing out the first couple of $n$ hasn't seemed to lead me anywhere.

$\endgroup$
  • 1
    $\begingroup$ Titles are meant to be just that: titles. The question should be located in the body along with some of your own thoughts...such as why induction failed or where you get stuck in a proof by contradiction. $\endgroup$ – Clayton Oct 31 '17 at 0:22
0
$\begingroup$

$$ \frac{1}{k} = \frac{1}{k+1} + \frac{1}{k^2 + k} $$

$\endgroup$
  • $\begingroup$ Yes, but this doesn't take into account that you need exactly n integers' reciprocals. $\endgroup$ – Gerard L. Nov 3 '17 at 23:55
  • $\begingroup$ @GerardL. actually, it does. How about if you begin with $1/2, 1/3, 1/6$ and see how to get four terms. $\endgroup$ – Will Jagy Nov 4 '17 at 0:16
  • $\begingroup$ I don't see your answer's application. $\endgroup$ – Gerard L. Nov 4 '17 at 0:30

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Not the answer you're looking for? Browse other questions tagged or ask your own question.