(adsbygoogle = window.adsbygoogle || []).push({}); (For the following problem I don't just want a flat out answer, but steps and Ideas on how to solve it. The problem was given by my Universities newspaper and for solving it you get free Loot and stuff) ----------------------------------------------------------------------------------------------------------------------------------------

The Problem:

Show that every set of n+1 positive integers, chosen from a set of 2n consecutive integers, contains at least one pair of relatively prime numbers.

relatively prime means: "Two integers are relatively prime if they share no common positive factors (divisors) except 1"

Example: 8 and 15 are relatively prime.

8 = 2 * 2 * 2 15 = 3 * 5

Example: 9 and 12 are NOT relatively prime

9 = 3 * 3 12 = 2 * 2 * 3

----------------------------------------------------------------------------------------------------------------------------------------

My thinking thus far:

None really I've just started

**Physics Forums - The Fusion of Science and Community**

# Show N has Prime Numbers

Know someone interested in this topic? Share a link to this question via email,
Google+,
Twitter, or
Facebook

Have something to add?

- Similar discussions for: Show N has Prime Numbers

Loading...

**Physics Forums - The Fusion of Science and Community**