Homework Help: math

Posted by harsh on Wednesday, February 13, 2013 at 12:35pm.

What is the minimum value of N that will make this statement true:

If we pick any N composite numbers from 1 to 1000, then we can find 2 numbers whose greatest common divisor is not 1.

Details and assumptions
You may use the fact that there are 168 primes from 1 to 1000.

math - hehe, Friday, February 15, 2013 at 4:16pm
No.

Answer this Question

Related Questions

math - The application of one function followed by the application of a second ...
Precalculus - The application of one function followed by the application of a ...
Calculus - True or False: Consider the following statement: A differentiable ...
math - Find the value of the missing digit that makes the statement true. 214,...
Algebra II - In an induction proof of the statement 4+7+10+...+(3n-1)=n(3n+5)/2 ...
math - 1)Find the third iterate x3 of f(x)=x2-4 for an initial value of x0=2 A)-...
math - can someone correct this for me... solve: -4(2x - 3) = -8x + 5 my answer...
social studies - " The Supreme Court has to censor and limit our first ...
math - Determine whether this function has a mzximum or minimum value and then ...
math - how would this equation look: y=f(x+3) when y=f(x)= x^2 would it look ...

For Further Reading

First Name:
School Subject:
Answer: