# Discrete math induction proof

Could someone help me with this induction proof. I know its true.

given any integer m is greater than or equal to 2, is it possible to find a sequence of m-1 consecutive positive integers none of which is prime? explain

any help is greatly appreciated thanks

Last edited:

Related Precalculus Mathematics Homework Help News on Phys.org
Is 5! prime?

HallsofIvy
Homework Helper
I'm sorry, Ziox, I really don't see what that has to do with the problem. Please enlighten me.

How do you know this is true?

My teacher only gave us true proofs so we wouldn't be able to prove it wrong by counter example.

I'm sorry, Ziox, I really don't see what that has to do with the problem. Please enlighten me.
5!+i has divisors 2,3,4,5 for i=2,...,5. Paired up respectively.

Last edited:
HallsofIvy
Homework Helper
Oh, of course! That answers the whole question. I was focusing on the "5" and didn't think about doing the same thing for n in general. Very nice.

kai89, do you understand what ZioX is saying?

Oh, of course! That answers the whole question. I was focusing on the "5" and didn't think about doing the same thing for n in general. Very nice.

kai89, do you understand what ZioX is saying?
You're right though, I was being pretty vague and probably would've only made sense if someone has seen it before. Should've said something about divisibility when adding.

HallsofIvy