×
×

# Prove there are infinitely many primes by showing that Qn

ISBN: 9780073383095 37

## Solution for problem 15E Chapter 4.SE

Discrete Mathematics and Its Applications | 7th Edition

• Textbook Solutions
• 2901 Step-by-step solutions solved by professors and subject experts
• Get 24/7 help from StudySoup virtual teaching assistants

Discrete Mathematics and Its Applications | 7th Edition

4 5 1 235 Reviews
20
2
Problem 15E

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.

Step-by-Step Solution:

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...

Step 2 of 3

Step 3 of 3

##### ISBN: 9780073383095

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.

#### Related chapters

Unlock Textbook Solution