Solution Found!
For exercise, use the fact that for all integersn, n! =n(n
Chapter 4, Problem 29E(choose chapter or problem)
QUESTION:
For exercises 28 and 29, use the fact that for all integers n, n! = n(n − 1) . . . \(3 \cdot 2 \cdot 1\).
Prove that for all integers n, if n > 2 then there is a prime number p such that n < p < n!.
Text Transcription:
3 cdot 2 cdot 1
Questions & Answers
QUESTION:
For exercises 28 and 29, use the fact that for all integers n, n! = n(n − 1) . . . \(3 \cdot 2 \cdot 1\).
Prove that for all integers n, if n > 2 then there is a prime number p such that n < p < n!.
Text Transcription:
3 cdot 2 cdot 1
ANSWER:Solution:Step 1:In this question, for all integers , if , then there is a prime number such that