how by contradiction that if 2n − 1 is prime, then n is prime.
Added by Reginald D.
Step 1
Let's think step by step. Show more…
Show all steps
Your feedback will help us improve your experience
Madhur L and 73 other AP CS 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
Show that if 2n - 1 is prime, then n is prime. [Hint: Use the identity 2ab - 1 = (2a - 1) · (2a(b-1) + 2a(b-2) + ···+ 2a + 1).]
Madhur L.
Supreeta N.
Prove or disprove (with a counterexample) the theorem: n is prime implies 2n + 1 is prime
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD