Prove, that if 2m + 1 is a prime number, then m must be a power of 2 (m = 2n, for some n ∈ N). Prime numbers in the form p = 2m + 1 are called Fermat's prime numbers. Plz write clearly.
Prove, that if 2m + 1 is a prime number, then m must be a power of 2 (m = 2n, for some n ∈ N). Prime numbers in the form p = 2m + 1 are called Fermat's prime numbers. Plz write clearly.
Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter2: The Integers
Section2.4: Prime Factors And Greatest Common Divisor
Problem 19E: Prove that if n is a positive integer greater than 1 such that n is not a prime, then n has a...
Related questions
Question
Prove, that if 2m + 1 is a prime number, then m must be a power of 2 (m = 2n, for some n ∈ N).
Prime numbers in the form p = 2m + 1 are called Fermat's prime numbers.
Plz write clearly.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 2 images
Recommended textbooks for you
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage