LOGICVILLE

PUZZLE CATEGORIES:

Mathematical

Logic

Cryptarithms
Anagrams Cryptograms Doublets
Chess Magic Word Squares Tangrams
Home
Bookstore
List of Puzzles
Christmas Puzzles
Nature Fractals
Fractal Images
Baseball Puzzles
Math Recreations
Cryptogram Challenge
Sudoku
Puzzle Categories
Solutions
Fun Survey
Support this Site
Privacy Statement

 

 

Previous Topic

Next Topic

SOPHIE GERMAIN PRIMES

A Sophie Germain Prime is a prime number P for which 2P+1 is also a prime.  These prime numbers include:

     2, 3, 5, 11, 23, 29, 41, 53, 89, 113, 131...

It can be noted that a Sophie Germain prime p > 3 is of the form 6k−1, since adding one to them make them a multiple of six.

These primes were named after the French mathematician Marie-Sophie Germain when she (around 1825) proved that Fermat's Last Theorem holds true for these primes.  That is, if n is a Sophie Germain prime greater than 2, then there are no whole numbers a, b, c such that

an + bn = cn.

It has been conjectured that there are infinitely many Sophie Germain primes, however, this conjecture has not yet been proven.

The corresponding prime numbers of the form 2P+1, where P is a Sophie Germain prime are called safe primes.

 

 

 

Previous Topic

Next Topic

Puzzles and Books Collections        Investment Subscription

 

Hosted By Web Hosting by PowWeb

© 2000-2008 Logicville