Given integer n>1, prove that we can find integer k>1 and a1, a2, ......ak >1 such that

a1 + a2 +........ak = n(1/a1 + 1/a2 +....1/ak)

Does this need some complex theorem to start with? Much thanks!

Printable View

- November 7th 2007, 12:56 AMgentslA much needed proof
Given integer n>1, prove that we can find integer k>1 and a1, a2, ......ak >1 such that

a1 + a2 +........ak = n(1/a1 + 1/a2 +....1/ak)

Does this need some complex theorem to start with? Much thanks! - November 7th 2007, 10:52 AMThePerfectHacker
- November 8th 2007, 02:39 PMgentsl
This means n = +/- sqrt a_k therefore k >1 must apply ? smilarly for a1 + a2 +........ak = n(1/a1 + 1/a2 +....1/ak)?

- November 10th 2007, 11:05 AMCaptainBlack
No it means that if you set then the left hand side equals and the right hand side is equal to , so the condition of the problem is satisfied by these values (at least it is when is a perfect square, otherwise the 's are not integers and we still need a solution).

RonL