Theorem: Suppose n is an integer larger than 1 and n is not prime. Then 2^(n) - 1 is not prime. What would you need for a proof of this result?
Added by Emilia F.
Step 1
** Show more…
Show all steps
Close
Your feedback will help us improve your experience
Nick Johnson and 51 other Algebra 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
Prove or disprove (with a counterexample) the theorem: n is prime implies 2n + 1 is prime
Madhur L.
If n^3-1 is a prime number, prove that n = 2
Hoan N.
Prove or disprove that $p_{1} p_{2} \cdots p_{n}+1$ is prime for every positive integer $n,$ where $p_{1}, p_{2}, \ldots, p_{n}$ are the $n$ smallest prime numbers.
Number Theory and Cryptography
Primes and Greatest Common Divisors
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD