Purchase Solution

Sophie Germain Primes

Not what you're looking for?

Ask Custom Question

Hello,
I need help with proving the following statement:

"A prime p is said to be a Sophie Germain prime if n = 2p+1 is also prime.
Prove that a prime p is a Sophie Germain prime if and only if 2^(n-1) = 1 (mod n)."

Thank you for your time.

Purchase this Solution

Solution Summary

The solution examines if Sophie Germain is prime.

Solution Preview

Proof:
" ": If the prime is a Sophie Germain prime, then is also prime. Obviously we have , according to Fermat's Little Theorem, we have
(mod )

" ": If , is a prime and we have (mod ), we want to show that is a prime. It is obvious that , according to Euler's Totient Theorem, we ...

Purchase this Solution


Free BrainMass Quizzes
Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts