Thursday
August 21, 2014

Homework Help: discrete math

Posted by Kai on Monday, March 26, 2007 at 5:01pm.

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

given then any integer m is less 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

I made a mistake... i meant any integer m is greater than or equal to 2

Answer this Question

First Name:
School Subject:
Answer:

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 ...
math induction - prove the product of 4 consecutive integers is always divisible...
proof by mathematical induction - subject is PreCalulus. 2^(k+3) = and < (k+3...
Discrete Math - 1. Assume that n is a positive integer. Use the proof by ...
Algebra II - In an induction proof of the statement 4+7+10+...+(3n-1)=n(3n+5)/2 ...
Math - Can someone check my answers and help me 1. A vector in standard position...
discrete math - prove that if n is an integer and 3n+2 is even, then n is even ...
discrete math - 1)prove that if x is rational and x not equal to 0, then 1/x is ...
math - 1)Find the third iterate x3 of f(x)=x2-4 for an initial value of x0=2 A)-...

Search
Members