Prove that for every positive integer n, there are n

Chapter 4, Problem 12E

(choose chapter or problem)

Get Unlimited Answers
QUESTION:

Prove that for every positive integer n, there are n con­secutive composite integers. [Hint: Consider the n con­secutive integers starting with (n + 1)! + 2.]

Questions & Answers

QUESTION:

Prove that for every positive integer n, there are n con­secutive composite integers. [Hint: Consider the n con­secutive integers starting with (n + 1)! + 2.]

ANSWER:

SolutionIn this question we need to prove that for any positive integer n, there are n consecutive positive integers.Step 1 For any composite number we can write,for some and Now n is a composite number if there is number such that .

Add to cart


Study Tools You Might Need

Not The Solution You Need? Search for Your Answer Here:

×

Login

Login or Sign up for access to all of our study tools and educational content!

Forgot password?
Register Now

×

Register

Sign up for access to all content on our site!

Or login if you already have an account

×

Reset password

If you have an active account we’ll send you an e-mail for password recovery

Or login if you have your password back