Question

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.

Answer 1

pLEASe Help

Answer 2

i think it is {no. of prime no between 1 to X} + 1
where
X = previous highest integer of sqrt(1000) = 31

so N = {No. of prime no. between 1 to 31 (including 31)} + 1
= 11 + 1 =12

so N= 12

Answer 3

THANK YOU