Euler's Method of proving primes r infinite

Aditya89
Messages
23
Reaction score
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
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:
Euler showed

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

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.
 
Hey thanks Shmoe! Could you explain Dirichlet's statement(What's an analagous sum?) and proof, please?

Aditya
 
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

\sum \frac{1}{p}

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

It involves using the Dirichlet L-functions,

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

where \chi(n) is a multiplicative character from the multiplicative group (\mathbb{Z}/q\mathbb{Z})^\times to the complex numbers and extended to the naturals by periodicity and setting \chi(n)=0 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:

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

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, L(s,\chi) 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 \L(1,\chi) is non zero when \chi 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:
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top