Results 1 to 4 of 4

Math Help - Relatively Prime Set of Integers

  1. #1
    Banned
    Joined
    Apr 2009
    Posts
    96

    Relatively Prime Set of Integers

    Hello all,

    Does anyone know of a set of 4 integers S=[a,b,c,d] where where a,b,c,d >0, and that 3 of the integers in S have a common divisor 'x' > 1 , but also that the GCD(a,b,c,d)=1 ?

    This is essentially plugging and playing in my mind, but I'm sure there is a more sophisticated method to this madness.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor
    Opalg's Avatar
    Joined
    Aug 2007
    From
    Leeds, UK
    Posts
    4,041
    Thanks
    7
    Quote Originally Posted by 1337h4x View Post
    Hello all,

    Does anyone know of a set of 4 integers S=[a,b,c,d] where where a,b,c,d >0, and that 3 of the integers in S have a common divisor 'x' > 1 , but also that the GCD(a,b,c,d)=1 ?

    This is essentially plugging and playing in my mind, but I'm sure there is a more sophisticated method to this madness.
    a = 2\times 3\times 5,
    b = 2\times 3\times 7,
    c = 2\times 5\times 7,
    d = 3\times 5\times 7.
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Banned
    Joined
    Apr 2009
    Posts
    96
    How did you reach this conclusion? Is there some sort of generic way to solve this? For example, if there was a set of 5 integers where 4 had a common divisor > 1 but the GCD was still equal to 1.
    Follow Math Help Forum on Facebook and Google+

  4. #4
    MHF Contributor
    Opalg's Avatar
    Joined
    Aug 2007
    From
    Leeds, UK
    Posts
    4,041
    Thanks
    7
    Quote Originally Posted by 1337h4x View Post
    How did you reach this conclusion? Is there some sort of generic way to solve this? For example, if there was a set of 5 integers where 4 had a common divisor > 1 but the GCD was still equal to 1.
    The pattern is this. Suppose you want to find a set of n positive integers a_1,a_2,\ldots,a_n for which every subset containing n1 of them has a common divisor > 1, but the GCD of the whole set of n integers is equal to 1. The method is to take n distinct prime numbers p_1,p_2,\ldots,p_n. For 1\leqslant k\leqslant n, let a_k be the product of all the ps except for p_k. Then p_k will divide all the as except for a_k. But there will be no common divisor (greater than 1) of all the as.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Relatively Prime Quadratic Integers
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: December 29th 2010, 01:04 PM
  2. Relatively prime integers
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: April 26th 2010, 08:49 AM
  3. Replies: 3
    Last Post: October 21st 2009, 07:58 PM
  4. Integers mod n is a field if and only if n is prime
    Posted in the Advanced Algebra Forum
    Replies: 2
    Last Post: August 30th 2009, 07:42 PM
  5. relatively prime integers....
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: March 16th 2008, 01:00 PM

Search Tags


/mathhelpforum @mathhelpforum