Results 1 to 2 of 2

Thread: Primes

  1. October 16th 2009, 07:15 AM #1
    usagi_killer
    usagi_killer is offline
    Senior Member
    Joined
    Apr 2009
    Posts
    271

    Primes

    Prove that if one chooses more than n numbers from the set then two of them are relatively prime.
    Follow Math Help Forum on Facebook and Google+
  2. October 16th 2009, 08:13 AM #2
    Bruno J.
    Bruno J. is offline
    MHF Contributor Bruno J.'s Avatar
    Joined
    Jun 2009
    From
    Canada
    Posts
    1,266
    Awards
    1
    MHF Donor
    Partition them as \{1,2\},\ \{3,4\},\ \hdots,\{2n-1,2n\}. Since there are n parts, one part must contain two of the numbers, and hence two of the numbers are adjacent. Since adjacent numbers are relatively prime we are done.
    Follow Math Help Forum on Facebook and Google+
« Prove these GCD(greast common denominator | d divides n and u = v (mod d) then f(u) = f(v) (mod d) -> f is polynomial over Z_n »

Similar Math Help Forum Discussions

  1. primes
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: April 2nd 2010, 10:18 AM
  2. Primes
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: August 8th 2009, 01:26 PM
  3. Primes
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: February 12th 2009, 09:59 PM
  4. Help with primes
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: January 20th 2009, 08:01 PM
  5. primes
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: October 16th 2008, 12:21 AM

Search Tags


/mathhelpforum @mathhelpforum