1 + 2 1 + 3 1 + 4 1 + 6 1 + 8 1 + 9 1 + 1 2 1 + 1 6 1 + 1 8 1 + ⋯ = ?
Clarification : The denominators are all positive integers whose prime divisors are either 2 and/or 3 only. In other words, they exclude all numbers with a prime factor greater than 3.
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! The penultimate step follows from the infinite geometric progression sum
a + a r + a r 2 + a r 3 + ⋯ = 1 − r a , ∣ r ∣ < 1 .
Bonus : Can you generalize this? That is, what is the sum of the reciprocals of positive integers whose prime factors are at least of the numbers 2 , 3 , 5 , … , p n only?
This is actually a pretty elegant solution. Well done! It's the same as evaluating
a = 0 ∑ ∞ b = 0 ∑ ∞ 2 a 3 b 1 = 3
The key is recognizing that each denominator is an unique product of powers of 2 and 3 , so that your product of infinite series generates only such unique denominators.
I see...that it why i didnt go to law school. I missed the line prime divisor greater than 2 or 3
I liked the problem and the solution. Thanks so much for sharing such an awesome problem. :)
However, you can make your solution more detailed by mentioning the sum of infinite geometric progression formulas.
Log in to reply
This is the way I tried to approach the problem. Since the numbers are divisible by 2 or 3 only. So ,
1 + 2 1 [ 1 + 2 1 + 3 1 . . . . . ] + 3 1 [ 1 + 2 1 + 3 1 . . . . . ] − 6 2 [ 1 + 2 1 + 3 1 . . . . . ] . .
= 1 + 2 1 [ 1 + 2 1 + 3 1 . . . . . ]
And I searched for the value of [ 1 + 2 1 + 3 1 . . . . . ] And they tell it will never converge and so will tend to infinity. So how could the answer come 3 . Please explain.
Please add in 8 1
I didn't got ya? Could you please explain how this product will give the same value of the given series?
Log in to reply
Notice the similarity with the Euler Product
So can you explain where the 1/6 gone
It does not converge to 3.33333 nor 3. Thru 1/300 already has a sum around 4.77+
Log in to reply
It does converge. Check the partial sums again.
x = 0 ∑ ∞ y = 0 ∑ ∞ 2 x 3 y 1 = ( x = 0 ∑ ∞ 2 x 1 ) ( y = 0 ∑ ∞ 3 y 1 )
I dont dispute convergence...but the number is not in the 3s.
The problem is not restricte to powers of 2 or 3....it says divisors of 2 or 3. 1/21 is an element of the series and it does not represent a product of a power of 2 and or 3
Log in to reply
I agree that it is a bit unclear but the problem states that
In other words, it excludes any positive integer that is divisible by a prime greater than 3.
what a champion
Bonus 2: Show that the value of the sum equals to ϕ ( n ) n (Euler's Totient Function) if we have a finite number of primes which have a product of n instead of only 2 and 3 .
Bonus 3: Show that 1 + 2 1 + 3 1 + ⋯ does not have a finite value.
The problem says "In other words, they exclude all the prime numbers greater than 3." This sort of implies that it does not exclude anything but the primes greater than 3, so, say "1/35" would be in the series. Of course the problem is still accurate but I feel it would be confused.
S = j = 0 ∑ ∞ k = 0 ∑ ∞ 2 j 3 k 1 = j = 0 ∑ ∞ 2 j 1 k = 0 ∑ ∞ 3 k 1 = 1 − 2 1 1 ⋅ 1 − 3 1 1 = 2 ⋅ 2 3 = 3
Let S be the original sum. Then S can be split into four sums: 1 + (1/2 + 1/4 + 1/8 + ...) + (1/3 + 1/9 + 1/27 + ...) + 1/6 (1 + 1/2 + 1/3 + 1/4 + 1/6 + ...) = 1 + 1 + 1/2 + 1/6 S = 5/2 + 1/6 S.
So S = 5/2 + 1/6 S and so S = 3.
Cool solution. I started off solving it this way but didn't get to the end. Ended up solving it exactly the way Chew-Seong Cheong did above.
For people who love geometric sequences, thats me. I didi it by separating it into 1 +1/2+1/4...... and 1/3+1/6+1/12.... and 1/9 +1/18+1/36.... 1+1/2+1/4....=2. and the infinite other sequences and 1/3 of each other.A Geometric sequence on a Geometric sequence. The a for a+an+an^2.... is equal to 1/3+1/6+1/12.... which is 2/3 while n is 1/3. Plugging it in the equation gets you 1. 2+1=3
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Geometric Progression Sum
The sum can be represented by the product ( 1 + 2 1 + 4 1 + 8 1 + … ) ( 1 + 3 1 + 9 1 + 2 7 1 + … )
= ( 1 − 2 1 1 ) ( 1 − 3 1 1 )
= 3 . □