Euler's Method of proving primes r infinite

In summary, Euler proved that primes are infinite by showing that the sum of the reciprocals of primes diverges. This was later extended by Dirichlet, who showed that there are infinitely many primes in arithmetic progressions. This involves using the Dirichlet L-functions to pick out primes in these progressions and showing that they do not vanish, leading to the divergence of the sum.
  • #1
Aditya89
23
0
I somewhere read that Euler proved that primes are infinite by proving that the series 1/2 +1/3 + 1/5 +... diverges. Can anybody tell the proof?

Aditya
 
Physics news on Phys.org
  • #2
He proved it diverges, so if this series were finite, summing finite terms, how can it become infinite ? Now for the proof of the divergence, I have no idea, but you can look at : http://planetmath.org/encyclopedia/PrimeHarmonicSeries.html
 
Last edited by a moderator:
  • #3
Euler showed

[tex]\sum_{n=1}^{\infty}\frac{1}{n^s}=\prod_{p\ prime}\left(1-\frac{1}{p^s}\right)^{-1}[/tex]

for real values of s greater than 1. You can look at the product up to p<x say, use the forumula for a geometric series and fundamental theorem of arithmetic to expand this product. Then show this approaches the sum on the left as x->infinity.

Let s go to 1, the sum on the left diverges (harmonic series), so the product must have infinitely many terms hence there are infinitey many primes.

Dirichlet later showed the analagous sum for primes in arithmetic progressions diverges.
 
  • #4
Hey thanks Shmoe! Could you explain Dirichlet's statement(What's an analagous sum?) and proof, please?

Aditya
 
  • #5
Let q and a be relatively prime. The idea is to show that there are infinitely many primes of the form a+qn by showing the sum

[tex]\sum \frac{1}{p}[/tex]

diverges, where this sum is taken over primes p=a+qn for some value of n.

It involves using the Dirichlet L-functions,

[tex]L(s,\chi)=\sum_{n=1}^{\infty}\frac{\chi(n)}{n^s}[/tex]

where [tex]\chi(n)[/tex] is a multiplicative character from the multiplicative group [tex](\mathbb{Z}/q\mathbb{Z})^\times[/tex] to the complex numbers and extended to the naturals by periodicity and setting [tex]\chi(n)=0[/tex] if n and q are not relatively prime.

These satisfy some nice orhtogonality relations that let us pick out arithmetic progressions like the sum we are interested in. We can show, for s>1:

[tex]\sum\chi(a)\log L(s,\chi)=\phi(q)\sum\frac{1}{p^s}+O(1)[/tex]

where the sum is taken over all characters mod q and the sum on the right is over all primes in our progression (phi is the usual euler phi function). When our character is trivial, [tex]L(s,\chi)[/tex] behaves much like the usual zeta function, and diverges to infinity as s approaches 1. Therefore, if you can show that the rest of the L-functions in the left hand sum behave and don't vanish (i.e. their log's behave) then the sum on the right will diverge like we need.

The hard part turns out to be showing that [tex]\L(1,\chi)[/tex] is non zero when [tex]\chi[/tex] is a real character, that is it only takes on values in the real numbers (actually +1 or -1), but that's the basic outline.
 
Last edited:

What is Euler's Method of proving primes are infinite?

Euler's Method is a mathematical proof, proposed by mathematician Leonhard Euler, that demonstrates the infinite nature of prime numbers. It involves using the divergence of the harmonic series to show that there must be infinitely many prime numbers.

How does Euler's Method work?

Euler's Method works by showing that the harmonic series, which is the sum of the reciprocals of all natural numbers, diverges. This means that the sum of the series becomes larger and larger as more terms are added. Using this divergence, Euler was able to prove that there must be infinitely many prime numbers.

Why is Euler's Method important?

Euler's Method is important because it provides a mathematical proof for the infinite nature of prime numbers, which was previously only known through observation. It also has implications for other areas of mathematics, such as number theory and analysis.

What are the limitations of Euler's Method?

One of the limitations of Euler's Method is that it does not provide an explicit formula or method for finding prime numbers. It only proves that they are infinite. Additionally, it assumes the existence of the Riemann zeta function, which has not yet been proven to exist for all complex numbers.

How has Euler's Method been further developed?

Since Euler's original proof, mathematicians have continued to build upon his method and develop new techniques for proving the infinitude of prime numbers. One notable example is the proof of the Prime Number Theorem, which provides a more precise estimate of the distribution of prime numbers.

Similar threads

  • Linear and Abstract Algebra
Replies
2
Views
793
  • Linear and Abstract Algebra
Replies
1
Views
2K
Replies
2
Views
2K
  • Linear and Abstract Algebra
Replies
11
Views
1K
Replies
1
Views
896
  • Precalculus Mathematics Homework Help
Replies
4
Views
1K
  • Linear and Abstract Algebra
Replies
6
Views
1K
  • Linear and Abstract Algebra
Replies
4
Views
1K
  • Precalculus Mathematics Homework Help
Replies
6
Views
1K
  • General Math
Replies
1
Views
2K
Back
Top