57 559
Assignments Done
Successfully Done
In February 2018
Your physics homework can be a real challenge, and the due date can be really close — feel free to use our assistance and get the desired result.
Be sure that math assignments completed by our experts will be error-free and done according to your instructions specified in the submitted order form.
Our experts will gladly share their knowledge and help you with programming homework. Keep up with the world’s newest programming trends.

Answer on Discrete Mathematics Question for scott sugg

Question #1753
Number theory..<br>Prove or disprove that for every integer "n" there is a sequence of "n" consecutive composite numbers.(example- five consecutive composite numbers are 32,33,34,35,36)
Expert's answer
Recall the de nition n! = 1 × 2 × 3 × ... × n for any positive integer n. Consider the consecutive positive integers (n+1)!+2, (n+1)!+3, . . . (n+1)!+(n+1).
By de nition of factorial, all integers from 2 to (n+1) divide (n+1)!, so 2|((n+1)!+2),
3|((n + 1)! + 3), and so on up to
(n + 1)|((n + 1)! + (n + 1))

Thus all members of this sequence are composite, making n consecutive composite numbers. This sequence can be generated for any n, so for all n there exists at least n consecutive composite numbers.

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!


No comments. Be first!

Leave a comment

Ask Your question