Prove there are infinitely many primes by showing that Qn = n! + 1 must have a prime factor greater than n whenever n is a positive integer.
SolutionStep 1In this problem we have to prove that there are infinitely many primes by showingmust have a prime factor greater than n where n is positive integers.Step 2Let us assume that .Now, consider that there are many finite primes number then have as many bigger factor of primes than .Hence, it doesn't follow the fundamental...
Textbook: Discrete Mathematics and Its Applications
Author: Kenneth Rosen
This full solution covers the following key subjects: factor, Greater, infinitely, Integer, must. This expansive textbook survival guide covers 101 chapters, and 4221 solutions. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095. The full step-by-step solution to problem: 15E from chapter: 4.SE was answered by , our top Math solution expert on 06/21/17, 07:45AM. This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7. Since the solution to 15E from 4.SE chapter was answered, more than 261 students have viewed the full step-by-step answer. The answer to “Prove there are infinitely many primes by showing that Qn = n! + 1 must have a prime factor greater than n whenever n is a positive integer.” is broken down into a number of easy to follow steps, and 28 words.