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...
- proof by induction - proof by mathmatical induction that the sum of the first n ...
- Discreet Mathematical Structures - Use proof by contraposition to prove the ...
- Math - Mathematical Induction - 3. Prove by induction that∑_(r=1)^n▒...
- proof by mathematical induction - subject is PreCalulus. 2^(k+3) = and < (k+3...
- 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. Assume that n is a positive integer. Use the proof by ...
- math - 1)Find the third iterate x3 of f(x)=x2-4 for an initial value of x0=2 A)-...
- Math - 1. Determine the formula for the nth term of the following sequence: 6, ...

More Related Questions