Sophie Germain Primes????????

Question

can someone answer the question of "are there an infinite number of Germain Primes?" in a simple way? because all the websites i'm finding that can answer that question are all mathematical and scientific and i can't understand them, lol. (^_^)

What I Know:
2p+1

And they are:
2, 3, 5, 11, 23, 29, 41, 53, 83, 89, 113, 131

Are there any more?

Answer 1

those guys above me are correct. I will say there are more than you listed lol, but as far as all of them I would honestly say that we may never know.
In case you are wondering yes we can create algorithms (computer programs) to find them and plug that into a supercomputer and just keep trying to find more and more, but that doesn't ever answer the question "how many are there" .
Also as the numbers that are tested by these computers get EXTREMELY high it can be rather difficult to break them down to their prime factorization and requires quite a bit of computer resources to do that. One of the things they have been doing for some time is laterally networking many small computers (yes many home computers jsut like you are using now) and part of their resources are spent calculating these numbers.

Answer 2

Steiner speaks the truth:

A prime p is said to be a Sophie Germain prime if both p and 2p+1 are prime. The first few Sophie Germain primes are 2, 3, 5, 11, 23, 29, 41, 53, 83, 89, 113, 131, ... (Sloane's A005384). It is not known if there are an infinite number of Sophie Germain primes (Hoffman 1998, p. 190).

Answer 3

No one knows if there are infinitely many. See http://mathworld.wolfram.com/SophieGermainPrime.html for a brief synopsis.

Answer 4

This is still an open question. If you can solve it,
you'll be famous!