Let $p \ge 2$. Prove that if $2^p - 1$ is prime, then $p$ must also be prime.
Added by Ryan W.
Close
Step 1
Therefore, the statement holds true for the base case. Show more…
Show all steps
Your feedback will help us improve your experience
Sri K and 89 other Calculus 3 educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
p is prime then p^2+1 is prime prove!!
Sri K.
If $p$ is a prime number, prove that for any integer $a, a^{p}=a \bmod p .$
Preliminary Notions
The Integers
Prove that if p and 8p + 1 are both prime, then 8p^2 + 1 is composite. Proof: Suppose p and 8p^2 + 1 are both prime, then we need to prove that 8p^2 + 1 is composite.
Madhur L.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD