MHB Can All Linear Diophantine Equations Be Solved?

  • Thread starter Thread starter Guest2
  • Start date Start date
  • Tags Tags
    Linear
AI Thread Summary
The discussion centers on the solvability of linear Diophantine equations. It is established that if \(a\) and \(b\) are relatively prime, then \(ax + by = N\) has integer solutions for any integer \(N\). For the specific equations, it is concluded that (a) is true, (b) is false due to the GCD not dividing the right-hand side, (c) is true as the GCD divides the RHS, and (d) is true since the GCD is 1. Additionally, participants suggest using modular arithmetic for quicker verification, particularly noting that equation (b) can be assessed by checking parity. The discussion emphasizes the importance of GCD in determining the existence of integer solutions.
Guest2
Messages
192
Reaction score
0
Decide which of the following equations are true or false. If false, explain/provide a counterexample.

(a) If $a, b \in \mathbb{Z}$ are relatively prime, then $ax+by = N$ has integer solutions for any integer $N$.
(b) The equation $70x+42y = 1409$ has integer solutions
(c) The equation $70x+42y = 1428$ has integer solutions
(d) The equation $2016x+4031y = 2014201520162017$ has integer solutions.

I think (a) is true since relativity prime means $\gcd(a, b) = 1$ and $1|N$.
 
Last edited:
Mathematics news on Phys.org
(b) $\gcd(70, 42) = 14$ which does not divide the RHS, so it has integer no solutions.
(c) $\gcd(70, 42) = 14$ which divides the RHS, so it has integer solutions.
(d) $\gcd(2016,4031) = 1$ which clearly divides the RHS so it has integer solutions.

Could someone please verify whether this is correct?
 
Last edited:
Guest said:
(b) $\gcd(70, 42) = 14$ which does not divide the RHS, so it has integer no solutions.
(c) $\gcd(70, 42) = 14$ which divides the RHS, so it has integer solutions.
(d) $\gcd(2016,4031) = 1$ which clearly divides the RHS so it has integer solutions.

Could someone please verify whether this is correct?

all including for (a) specified in 1st post correct
 
kaliprasad said:
all including for (a) specified in 1st post correct
Thanks. Is there a quicker way to do these questions, perhaps using something like modular arithmetic?
 
Guest said:
Thanks. Is there a quicker way to do these questions, perhaps using something like modular arithmetic?

(b) can be done quicker, for instance mod 2.
More specifically, the left hand side is even, while the right hand side is odd.
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Is it possible to arrange six pencils such that each one touches the other five? If so, how? This is an adaption of a Martin Gardner puzzle only I changed it from cigarettes to pencils and left out the clues because PF folks don’t need clues. From the book “My Best Mathematical and Logic Puzzles”. Dover, 1994.
Thread 'Imaginary Pythagoras'
I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...

Similar threads

Back
Top