Greatest Common Divisor of Four Distinct Positive Integers

  • Thread starter Thread starter knowLittle
  • Start date Start date
  • Tags Tags
    Gcd
AI Thread Summary
To find four distinct positive integers with a greatest common divisor (gcd) of 6 for all pairs, the integers should be in the form of 6 multiplied by distinct integers. An example set is 6, 12, 18, and 30, which meets the criteria. The discussion clarifies that using 6 ensures the gcd remains 6, provided the other integers are also multiples of 6. It is emphasized that the integers should be distinct and that the pairs formed from these integers yield a gcd of 6. The correct formulation involves using distinct primes or 1 in the multiples.
knowLittle
Messages
307
Reaction score
3

Homework Statement


Give an example of a set S of four (distinct) positive integers such that the greatest common divisor of all
six pairs of elements of S is 6.

Homework Equations


The Attempt at a Solution



Can I say that my numbers are in the form?
6
12
18
30
Is this ok?
 
Last edited:
Physics news on Phys.org
Are you sure you have the question worded correctly? The title says four pairs, the question refers to six.
 
You don't need to skip 24. Using 6 as your first number will guarantee that the gcd is 6 as long as all of your other integers are of the form 6n where n is an integer.
 
Nascent,
4 choose 2 at a time is 6 possible pairs of gcd.

Mentallic,
If I used gcd(12, 24) = 12 and it doesn't satisfy the conditions.
 
Ahh that makes a lot more sense now. Then yes, what you've done is correct. It just needs to be of the form

6p_1, 6p_2, 6p_3, 6p_4

where pn is a distinct prime or 1.
 
  • Like
Likes 1 person
Thanks :>
 
Back
Top