Problem 896. Sophie Germain prime

• Created by Aurelien Queffurust
• Appears in 3 groups

×

By solving this problem, you will make progress in the following group(s)

Basics - Prime Numbers

• 10 Problems
• 436 Finishers

Number theory

• 44 Problems
• 21 Finishers

The Prime Directive

• 14 Problems
• 37 Finishers

Like (4)

Difficulty:

(477)

Rate

• Solve Later   
• Add To GroupÂ

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.

Solve

Solution Stats

48.51% Correct | 51.49% Incorrect

• 2016 Solutions
• 905 Solvers

Last Solution submitted on Mar 31, 2025

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers905

Suggested Problems

• Times 2 - START HERE

  105471 Solvers

• Encode Roman Numerals

  1969 Solvers

• De-dupe

  3437 Solvers

• Side of an equilateral triangle

  6409 Solvers

• Given a square and a circle, please decide whether the square covers more area.

  1236 Solvers

More from this Author30

• Cody Computer Part 5 - Guess the Name of Cody Computer

  59 Solvers

• Set the array elements whose value is 13 to 0

  1381 Solvers

• Join Strings with Multiple Different Delimiters

  200 Solvers

• Return unique values without sorting

  939 Solvers

• Make a logical diamond using GALLERY function

  97 Solvers