Let n be an integer > 1 and N = n! + 1 a) Prove that N has a prime divisor > n b) Use a) to prove that there are infinitely many prime numbers
Let n be an integer > 1 and N = n! + 1 a) Prove that N has a prime divisor > n b) Use a) to prove that there are infinitely many prime numbers
Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter10: Sequences, Series, And Probability
Section10.4: Mathematical Induction
Problem 25E
Related questions
Question
Let n be an integer > 1 and N = n! + 1
a) Prove that N has a prime divisor > n
b) Use a) to prove that there are infinitely many prime numbers
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 3 steps with 2 images
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning