Asked by Andy

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.

Answers

Answered by juan
It is 72
There are no AI answers yet. The ability to request AI answers is coming soon!

Related Questions