Posted by **Kai** on Monday, March 26, 2007 at 10:39pm.

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

given then 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

Does the sequence have to start at m?

## Answer This Question

## Related Questions

- discrete math - Could someone help me with this induction proof. I know its true...
- math induction - prove the product of 4 consecutive integers is always divisible...
- Algebra II - In an induction proof of the statement 4+7+10+...+(3n-1)=n(3n+5)/2 ...
- discrete math - 1)prove that if x is rational and x not equal to 0, then 1/x is ...
- Discrete Math - Theorem: For every integer n, if x and y are positive integers ...
- math - 1)Find the third iterate x3 of f(x)=x2-4 for an initial value of x0=2 A)-...
- math, algebra - 2a+2ab+2b I need a lot of help in this one. it says find two ...
- math - What is the smallest of three consecutive integers if the sum of the ...
- math - What is the smallest of three consecutive integers if the sum of the ...
- proof by induction - proof by mathmatical induction that the sum of the first n ...

More Related Questions