In number theory, a prime number p is a Sophie Germain prime if 2p + 1 is also prime. For example, 23 is a Sophie Germain prime because it is a prime and 2 × 23 + 1 = 47, and 47 is also a prime number. These numbers are named after French mathematician Marie-Sophie Germain.
See Sophie Germain prime article on Wikipedia.
In this Problem , the input is a number and you must return true or false if this number is a Sophie Germain prime.
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers1067
Suggested Problems
-
9159 Solvers
-
Project Euler: Problem 3, Largest prime factor
1800 Solvers
-
Project Euler: Problem 5, Smallest multiple
1661 Solvers
-
Number of 1s in a binary string
11253 Solvers
-
1130 Solvers
More from this Author30
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
None of the test cases actually check if the prime is Sophie Germain...