1 = 1/a + 1/b + ...

Can the sum of the reciprocals of any ten odd numbers equal one?

No Yes

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Jake Lai
Nov 4, 2015

We will prove that 1 can never be written as an even number of odd number reciprocals.

Let the odd numbers be a 1 , a 2 , , a 2 n a_1, a_2, \ldots , a_{2n} . Suppose we have

1 = 1 a 1 + 1 a 2 + + 1 a 2 n 1 = \frac{1}{a_1}+\frac{1}{a_2}+ \ldots +\frac{1}{a_{2n}}

Now, let b k = a 1 a 2 a 2 n / a k b_k = a_1a_2 \ldots a_{2n}/a_k (the product of all a i a_i except a k a_k ). Multiplying both sides with a 1 a 2 a 2 n a_1a_2 \ldots a_{2n} , we get

a 1 a 2 a 2 n = b 1 + b 2 + + b 2 n a_1a_2 \ldots a_{2n} = b_1 + b_2 + \ldots + b_{2n}

The product of odd numbers is always odd, so a 1 a 2 a 2 n a_1a_2 \ldots a_{2n} and b k b_k has to be odd. The sum of 2 n 2n odd numbers (in this case b k b_k ), however, is always even for any whole number n n .

Since both sides have different parities (LHS is odd, RHS is even), the Diophantine equation has no solutions.

Of course, it is then an immediate result that 10 odd number reciprocals will never sum to 1.

Correct and excellent solution!

Trung Le - 5 years, 7 months ago
Aareyan Manzoor
Nov 4, 2015

its really easy. we say 1 = n = 1 10 1 2 a n 1 1=\sum_{n=1}^{10}\dfrac{1}{2a_n-1} where a n a_n is a integer. now we multiply: n = 1 10 ( 2 a n 1 ) = 0 < b 1 < b 2 < . . . < b 9 < 11 ( n = 1 9 ( 2 a b n 1 ) ) \prod_{n=1}^{10} (2a_n-1)=\sum_{0<b_1<b_2<...<b_9<11} (\prod_{n=1}^{9} (2a_{b_n}-1)) we see that LHS is odd as it is multiple of odds only. the product on the RHS becomes odd. but when we add 10 odds, it becomes even. since LHS=odd,RHS=even, they cannot be equal. genarally 1 can not be written as sum of reciprocals of 2n odd integers.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...