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
-
How to find the position of an element in a vector without using the find function
2822 Solvers
-
760 Solvers
-
Calculate the area of a triangle between three points
3570 Solvers
-
Given a matrix, swap the 2nd & 3rd columns
1284 Solvers
-
Number of Even Elements in Fibonacci Sequence
1691 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...