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  What is the minimum value of N that will make this statement true: If we ...
 math  Can someone help me with prime and composite numbers? Prime numbers are ...
 math  What is the greatest common divisor of the three numbers 675,375, and ...
 math  which of these statements about prime and composite numbers is true? F)...
 coomon factors  I don't understand common factors. can someone show me how to ...
 Math  List the common multiples from 1 to 100 for each pair of numbers. Then ...
 Math  Use <, >, or = to make this statement true. 1. 8/9 11/12 < 2. 4/...
 wollega  draw flow chart & write pseudo code for greatest common divisor of two...
 algebra  true or false 1. fraction cant be written as decimal. 2. natural ...
 math  A. Find 3 pairs of numbers for which the least common multiple equals the...
More Related Questions