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.
1 answer
It is 72
If we pick any N composite numbers from 1 to 1000, then we can find 2 numbers whose greatest common divisor is not 1.
1 answer
1 answer
1 answer
5 answers
1 answer