- #1

Brimley

- 77

- 0

Could someone show me how there are inifintely many primes in Q[Sqrt(d)]?

I figure this will be very similar to the proof of there being infinitely many primes in Z.

I cited the above from Wikipedia -Prime Number - The Number of Prime Numbers

There are infinitely many prime numbers. The oldest known proof for this statement, sometimes referred to as Euclid's theorem, is attributed to the Greek mathematician Euclid. Euclid states the result as "there are more than any given [finite] number of primes", and his proof is essentially the following:

Consider any finite set of primes. Multiply all of them together and add 1 (see Euclid number). The resulting number is not divisible by any of the primes in the finite set we considered, because dividing by any of these would give a remainder of 1. Because all non-prime numbers can be decomposed into a product of underlying primes, then either this resultant number is prime itself, or there is a prime number or prime numbers which the resultant number could be decomposed into but are not in the original finite set of primes. Either way, there is at least one more prime that was not in the finite set we started with. This argument applies no matter what finite set we began with. So there are more primes than any given finite number. (Euclid, Elements: Book IX, Proposition 20)