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
Solution Comments
Show commentsProblem Recent Solvers1072
Suggested Problems
-
Project Euler: Problem 9, Pythagorean numbers
1406 Solvers
-
Sum the numbers on the main diagonal
620 Solvers
-
Create an index-powered vector
968 Solvers
-
Find my daddy long leg (No 's')
2858 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
2241 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...