Divergence of the sum of the reciprocals of the primes

In summary, the conversation discusses the use of a theorem to prove that the sum of the reciprocals of primes diverges. The theorem states that a product converges to a nonzero value if and only if the sum of its terms converges. The conversation also mentions using logarithms to prove the convergence of an infinite product. The conversation concludes by mentioning a book as a reference for further understanding.
Physics news on Phys.org
  • #2
Karamata said:
Hi, can you tell me which theorem they have used here: http://everything2.com/title/proof+that+the+sum+of+the+reciprocals+of+the+primes+diverges

i'm thinking on part: Well, there's an elementary theorem of calculus that a product (1-a1)...(1-ak)... with ak->0 converges to a nonzero value iff the sum a1+...+ak+... converges.

Sorry for bad english :redface:



They are using...that theorem. If you want to see why is true take into consideration everything's positive

here and apply logarithms. Of course, you could also google "infinite products"...:>)

DonAntonio
 
  • #3
Well, I can say:

Let [itex]a_n>0, ~n\in \bf{N}[/itex]. We can say [itex]\displaystyle\prod_{n=1}^{+\infty}(1+a_n)[/itex] converge iff converge [itex]\displaystyle\sum_{n=0}^{+\infty}\log(1+a_n)[/itex]. Also, [itex]\displaystyle\sum_{n=0}^{+\infty}\log(1+a_n)[/itex] converge iff converge [itex]\displaystyle\sum_{n=0}^{+\infty}a_n[/itex], because [itex]\displaystyle\lim_{n\to +\infty}\frac{\log(1+a_n)}{a_n} = 1[/itex].

So, we have: [itex]\displaystyle\prod_{n=1}^{+\infty}(1+a_n)[/itex] converge iff converge [itex]\displaystyle\sum_{n=0}^{+\infty}a_n[/itex].

BUT, here, I have this minus...?!?:rolleyes:
 
  • #4
Karamata said:
Well, I can say:

Let [itex]a_n>0, ~n\in \bf{N}[/itex]. We can say [itex]\displaystyle\prod_{n=1}^{+\infty}(1+a_n)[/itex] converge iff converge [itex]\displaystyle\sum_{n=0}^{+\infty}\log(1+a_n)[/itex]. Also, [itex]\displaystyle\sum_{n=0}^{+\infty}\log(1+a_n)[/itex] converge iff converge [itex]\displaystyle\sum_{n=0}^{+\infty}a_n[/itex], because [itex]\displaystyle\lim_{n\to +\infty}\frac{\log(1+a_n)}{a_n} = 1[/itex].

So, we have: [itex]\displaystyle\prod_{n=1}^{+\infty}(1+a_n)[/itex] converge iff converge [itex]\displaystyle\sum_{n=0}^{+\infty}a_n[/itex].

BUT, here, I have this minus...?!?:rolleyes:



Don't worry about that: check theorem 1 here http://tinyurl.com/7cu4k4p , which sends you to check the nice book by

Knopp "Infinite sequences and series" (see chapter 3, section 7 there)

DonAntonio
 
  • #5
OK, it seems well.

Thanks.
 

Related to Divergence of the sum of the reciprocals of the primes

What is the "Divergence of the sum of the reciprocals of the primes"?

The divergence of the sum of the reciprocals of the primes is a concept in mathematics that refers to the fact that the sum of the reciprocals of the prime numbers (numbers that are only divisible by 1 and themselves) is infinite. In other words, as more prime numbers are added together, the sum will continue to increase without ever reaching a finite value.

Why is the "Divergence of the sum of the reciprocals of the primes" important?

The divergence of the sum of the reciprocals of the primes is important because it helps us understand the nature of infinity and the distribution of prime numbers. It also has practical applications in number theory and cryptography.

Who first discovered the "Divergence of the sum of the reciprocals of the primes"?

The concept of the divergence of the sum of the reciprocals of the primes was first discovered by the Greek mathematician Euclid in the 3rd century BC. However, it was not until the 18th century that mathematicians began to study the sum in more detail.

Is there a formula for calculating the "Divergence of the sum of the reciprocals of the primes"?

Yes, there is a formula known as the Euler-Mascheroni constant that can be used to approximate the sum of the reciprocals of the primes. However, this formula is only an approximation and becomes less accurate as more prime numbers are added to the sum.

Can the "Divergence of the sum of the reciprocals of the primes" be proven?

Yes, the divergence of the sum of the reciprocals of the primes can be proven using mathematical techniques such as the Euler-Maclaurin formula and the Prime Number Theorem. However, the proof is complex and requires a deep understanding of advanced mathematics.

Similar threads

  • Calculus
Replies
4
Views
1K
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
2
Views
1K
Replies
5
Views
3K
  • General Math
Replies
5
Views
2K
Replies
1
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
10
Views
6K
Replies
9
Views
7K
  • Poll
  • Science and Math Textbooks
Replies
12
Views
11K
Replies
2
Views
2K
Back
Top