Finding 5 Positive Integers with GCD Difference

In summary: So now we have:348, 350, 351, 352, 360, 368, 370, 371, 372, 374.In summary, the five positive integers that solve the equation are: 12, 14, 15, 16, and 24.
  • #1
Mr Davis 97
1,462
44

Homework Statement


Do five positive integers exist such that the positive difference between any two is the greatest common divisor of those two numbers?

Homework Equations

The Attempt at a Solution


I found four such numbers, ##\{6,8,9,12\}##. I did this in an ad hoc way though without any real method. What ways can I attack this problem, given that I've tried to find 5 numbers without much progress?
 
Physics news on Phys.org
  • #2
I don't have a proof, but my guess is, that it is not possible.

Just an idea:
Let ##x,y## be such two numbers. The requirement is then ##x\cdot \mathbb{Z}+y \cdot \mathbb{Z} = (x-y)\cdot \mathbb{Z}## or that there are integers ##\alpha,\beta## such that ##x-y=\alpha x +\beta y##, i.e. ##y=\dfrac{1-\alpha}{1+\beta}x##. Hence we have found a pair ##(x,y)## if we would have found a pair ##(\alpha,\beta)## of integers, such that the quotient ##\dfrac{1-\alpha}{1+\beta} \in \mathbb{Z}##. My idea is to translate the problem into a geometric one. We need five numbers ##\alpha_i## such that ##q_{ij} := \dfrac{1-\alpha_i}{1+\alpha_j} \in \mathbb{Z}##. If we can identify each number with a point on the lattice ##\mathbb{Z}^2## and draw an edge, if ##q_{ij} \in \mathbb{Z}##, then we get a pentagram. Now my idea is, that there can't be such a pentagram in ##\mathbb{Z}^2.## Or we set the pairs ##(\alpha_i,\alpha_j)## as points and show that there cannot be ten of them. Maybe it's also possible to show that given four such numbers, i.e. six pairs, that there cannot be added a fifth integer one by algebraic methods (calculations).
 
  • #3
I believe I found a solution using five numbers in the range [23.3.5.7.11-24, 23.3.5.7.11].

To arrive at this, I considered how many of the numbers can be odd, how many 2 mod 4, how many 1 mod 3, etc.
 
Last edited:
  • #4
Klystron said:
Given this is not my thread or homework assignment, could you please explain the notation of your solution?
I'm having difficulty understanding the list within the square brackets. Thanks.
I mean the range [x-24,x], i.e. from x-24 to x inclusive, where x=23.3.5.7.11.
 
  • #5
haruspex said:
I mean the range [x-24,x], i.e. from x-24 to x inclusive, where x=23.3.5.7.11.
Are you using periods to denote multiplication? If so, I think that might be the notation Klystron was asking about.
 
  • #6
The Bill said:
Are you using periods to denote multiplication? If so, I think that might be the notation Klystron was asking about.
Yes. Isn't that standard in number theory?
 
  • #7
Found a much simpler solution by basing it around 23 and 32.
Using the approach I indicated in post #3, it looks good to start with three consecutive numbers, the middle one being an odd multiple of 3. The other numbers must all be divisible by 4, and at least one divisible by 8.
So we can make a guess like 12, 14, 15, 16, 24.
Clearly 24-14 isn't working, and neither is 24-15. We can add any multiple of 24 to all the numbers without disturbing any of the other relationships. To fix 24-14 we need to make those two multiples of 10, so add 96:
108, 110, 111, 112, 120.
120-111 is still not right. We need to make those divisible by 9 by adding a suitable multiple of 120:
348, 350, 351, 352, 360.
 
  • Like
Likes fresh_42

1. What is the purpose of finding 5 positive integers with GCD difference?

The purpose of finding 5 positive integers with GCD difference is to understand and analyze the relationship between the greatest common divisor (GCD) and the difference between two numbers. This can help in various mathematical and computational problems where the GCD plays a crucial role.

2. How do you find 5 positive integers with GCD difference?

To find 5 positive integers with GCD difference, you can start by choosing any two numbers and finding their GCD using the Euclidean algorithm. Then, you can add or subtract the GCD from one of the numbers to get a new number. Repeat this process until you have 5 numbers with the desired GCD difference.

3. What is the significance of the GCD difference in finding positive integers?

The GCD difference is significant because it helps in identifying the common factors between two numbers. By finding 5 positive integers with the same GCD difference, we can determine the unique combination of factors that contribute to the GCD of those numbers.

4. Can you find 5 positive integers with any GCD difference?

Yes, it is possible to find 5 positive integers with any GCD difference. However, the numbers may not be unique as there can be multiple combinations of factors that result in the same GCD difference.

5. How can finding 5 positive integers with GCD difference be applied in real life situations?

Finding 5 positive integers with GCD difference can be applied in various real-life situations, such as cryptography, data encryption, and error correction codes. It can also be used in optimizing algorithms and solving complex mathematical problems involving factors and multiples.

Similar threads

  • Calculus and Beyond Homework Help
Replies
2
Views
1K
  • Calculus and Beyond Homework Help
Replies
9
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Precalculus Mathematics Homework Help
Replies
2
Views
975
  • Calculus and Beyond Homework Help
Replies
22
Views
2K
  • Calculus and Beyond Homework Help
Replies
1
Views
7K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
Replies
1
Views
3K
  • Precalculus Mathematics Homework Help
Replies
2
Views
1K
  • Calculus and Beyond Homework Help
Replies
2
Views
2K
Back
Top