Consider the following statement. For every integer n, if n > 2 then there is a prime number p such that n 2, n! - 1 is an integer that is greater than 1. 4. So by the divisibility by a prime theorem (Theorem 4.4.4), there is a prime number p such that p|(n! – 1). . 5. Thus, p < n! - 1, and so p < n!. 6. Therefore, by steps 2 and 5, there is a prime number p such that n < p < n!.

College Algebra (MindTap Course List)
12th Edition
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:R. David Gustafson, Jeff Hughes
Chapter8: Sequences, Series, And Probability
Section8.5: Mathematical Induction
Problem 42E
icon
Related questions
Question
Consider the following statement.
For every integer n, if n > 2 then there is a prime number p such that n <p< n!.
The statement is true, but the following proposed proof is incorrect.
Proposed proof:
1. Let n be any integer that is greater than 2.
2. By the infinitude of the primes theorem (Theorem 4.8.4),
there is a prime number p such that n < p.
3. Since n > 2, n! - 1 is an integer that is greater than 1.
4. So by the divisibility by a prime theorem
(Theorem 4.4.4), there is a prime number p such that
p|(n! - 1)..
5. Thus, p < n! - 1, and so p < n!.
6. Therefore, by steps 2 and 5, there is a prime number p
such that n <p< n!.
Identify the error(s) in the proposed proof. (Select all that apply.)
O The divisibility by a prime theorem is incorrectly applied in step 4.
O The p in step 2 may not be the same as the p in step 5.
O The statement can only be proved by contradiction.
O The proof does not work if n is prime.
O The infinitude of the primes theorem is incorrectly applied in step 2.
O p|(n! – 1) does not imply that p is less than or equal to n! – 1.
O The proof does not work if n! - 1 is prime.
Transcribed Image Text:Consider the following statement. For every integer n, if n > 2 then there is a prime number p such that n <p< n!. The statement is true, but the following proposed proof is incorrect. Proposed proof: 1. Let n be any integer that is greater than 2. 2. By the infinitude of the primes theorem (Theorem 4.8.4), there is a prime number p such that n < p. 3. Since n > 2, n! - 1 is an integer that is greater than 1. 4. So by the divisibility by a prime theorem (Theorem 4.4.4), there is a prime number p such that p|(n! - 1).. 5. Thus, p < n! - 1, and so p < n!. 6. Therefore, by steps 2 and 5, there is a prime number p such that n <p< n!. Identify the error(s) in the proposed proof. (Select all that apply.) O The divisibility by a prime theorem is incorrectly applied in step 4. O The p in step 2 may not be the same as the p in step 5. O The statement can only be proved by contradiction. O The proof does not work if n is prime. O The infinitude of the primes theorem is incorrectly applied in step 2. O p|(n! – 1) does not imply that p is less than or equal to n! – 1. O The proof does not work if n! - 1 is prime.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning
Elements Of Modern Algebra
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
Algebra and Trigonometry (MindTap Course List)
Algebra and Trigonometry (MindTap Course List)
Algebra
ISBN:
9781305071742
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning
College Algebra
College Algebra
Algebra
ISBN:
9781337282291
Author:
Ron Larson
Publisher:
Cengage Learning