When will there exist solutions to ax + (a+2)y = c?

  • Thread starter Thread starter Shackleford
  • Start date Start date
Click For Summary
The discussion centers on the conditions for solutions to the linear Diophantine equation ax + (a+2)y = c. A solution exists when the greatest common divisor (gcd) of a and (a+2) divides c. Participants note that both a and (a+2) will share parity, being either both odd or both even. There is a suggestion to utilize Bezout's theorem to find specific and general solutions, although there is some confusion regarding the equation's form. The conversation emphasizes the importance of expressing the gcd in a simplified manner for clarity.
Shackleford
Messages
1,649
Reaction score
2

Homework Statement



When will there exist solutions to ax + (a+2)y = c?

Homework Equations



GCD

The Attempt at a Solution



Of course, this is a linear Diophantine equation. I know that a solution will exist when gcd(a, (a+2)) | c.

gcd(a, (a+2)) = d ⇒ ∃ x,y ∈ ℤ ∋ xa + y(a+2) = d

a = 0(a+2) + a
a+2 = (a) + 2
a = β(2) + r
 
Physics news on Phys.org
gcd(a, (a+2)) has a shorter expression.
Not sure what the last three lines are saying.
 
mfb said:
gcd(a, (a+2)) has a shorter expression.
Not sure what the last three lines are saying.

I just started the algorithm for finding the GCD, but I don't think that I actually need to find an expression.

Hm. Well, I know that a and a+2 are both odd or even depending on a.
 
Shackleford said:

Homework Statement



When will there exist solutions to ax + (a+2)y = c?

Homework Equations



GCD

The Attempt at a Solution



Of course, this is a linear Diophantine equation. I know that a solution will exist when gcd(a, (a+2)) | c.

gcd(a, (a+2)) = d ⇒ ∃ x,y ∈ ℤ ∋ xa + y(a+2) = d

a = 0(a+2) + a
a+2 = (a) + 2
a = β(2) + r

Have you forgotten to tell us whether or not a, c, x, y are positive (non-negative?) integers?
 
Ray Vickson said:
Have you forgotten to tell us whether or not a, c, x, y are positive (non-negative?) integers?

Partially. a, b ∈ ℕ and x, y ∈ ℤ and 1 ≤ d ≤ min{a,b}.
 
If you want to solve mu+nv = d when m and n are relatively prime, you should be able to find a specific solution with Bezout theorem. With that specific solution, you should be able to find a general solution (u,v) without too much difficulty.

The thing is that ax +(a+2) y = c has not that form, or at least not always. Why ? Mfb gave you a good hint. Think about it
 
Shackleford said:
I just started the algorithm for finding the GCD, but I don't think that I actually need to find an expression.
I think you should, as the final expression is very easy. It is a bit like leaving 4+5 in a final answer. It is not wrong in terms of mathematics, but you should replace it by 9.
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 23 ·
Replies
23
Views
933
  • · Replies 5 ·
Replies
5
Views
2K
Replies
1
Views
1K
  • · Replies 18 ·
Replies
18
Views
2K
Replies
4
Views
2K
Replies
1
Views
1K
  • · Replies 8 ·
Replies
8
Views
4K