math

posted by .

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 -

    No.

Respond to this Question

First Name
School Subject
Your Answer

Similar Questions

  1. math

    Can someone help me with prime and composite numbers?
  2. coomon factors

    I don't understand common factors. can someone show me how to find the greatest common factor of 385 and 1365?
  3. algebra

    true or false 1. fraction cant be written as decimal. 2. natural numbers are referred to as counting numbers.whole numbers consists of counting numbers.whole numbers consist of counting numbers as well as the number 0 3. intergers …
  4. math

    which of these statements about prime and composite numbers is true?
  5. Math

    List the common multiples from 1 to 100 for each pair of numbers. Then find the least common multiple for each pair. 8 and 12, 3 and 15, 7 and 11, 9 and 10, 24 and 36, 20 and 25, 42 and 14, 30 and 12 Then find pairs of numbers for …
  6. Math

    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.
  7. math

    What is the greatest common divisor of the three numbers 675,375, and 1125
  8. Math

    Use <, >, or = to make this statement true. 1. 8/9 11/12 < 2. 4/7 9/16 > 3. 13/20 17/25 < Order this set of numbers from least go greatest 9/14 66% 2/3 0.61 5/8 67% 0.65 Answer: 0.61, 5/8, 9/14, 0.65, 66%, 2/3, 0.67
  9. math

    A. Find 3 pairs of numbers for which the least common multiple equals the product of the the 2 numbers. B. Look at the pairs of numbers you found in part a. What is true about all 3 pairs of numbers?
  10. wollega

    draw flow chart & write pseudo code for greatest common divisor of two numbers

More Similar Questions