Can the sum of the reciprocals of any ten odd numbers equal one?
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.
Correct and excellent solution!
its really easy. we say 1 = n = 1 ∑ 1 0 2 a n − 1 1 where a n is a integer. now we multiply: n = 1 ∏ 1 0 ( 2 a n − 1 ) = 0 < b 1 < b 2 < . . . < b 9 < 1 1 ∑ ( n = 1 ∏ 9 ( 2 a 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.
Problem Loading...
Note Loading...
Set Loading...
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 . Suppose we have
1 = a 1 1 + a 2 1 + … + a 2 n 1
Now, let b k = a 1 a 2 … a 2 n / a k (the product of all a i except a k ). Multiplying both sides with a 1 a 2 … a 2 n , we get
a 1 a 2 … a 2 n = b 1 + b 2 + … + b 2 n
The product of odd numbers is always odd, so a 1 a 2 … a 2 n and b k has to be odd. The sum of 2 n odd numbers (in this case b k ), however, is always even for any whole number 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.