Can All Linear Diophantine Equations Be Solved?

  • MHB
  • Thread starter Guest2
  • Start date
  • Tags
    Linear
In summary: Since an even number can never be equal to an odd number, we can conclude that the equation has no integer solutions. In summary, (a) is true since relatively prime integers always have integer solutions for any integer N. (b) has no integer solutions since the LHS is even and the RHS is odd. (c) has integer solutions since both sides have a common factor of 14. (d) has integer solutions since the GCD of the coefficients is 1, indicating that the RHS is a multiple of 1.
  • #1
Guest2
193
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
  • #2
(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:
  • #3
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
 
  • #4
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?
 
  • #5
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.
 

FAQ: Can All Linear Diophantine Equations Be Solved?

What is a linear diophantine equation?

A linear diophantine equation is an algebraic equation in the form of ax + by = c, where a, b, and c are integers and x and y are variables. The goal is to find integer solutions for x and y that satisfy the equation.

How is a linear diophantine equation solved?

One method for solving a linear diophantine equation is through the use of the Euclidean algorithm, which involves finding the greatest common divisor of the coefficients a and b. This can be done by using the extended Euclidean algorithm or by using the Bezout's identity theorem. Another method is through the use of modular arithmetic and the Chinese remainder theorem.

What is the importance of linear diophantine equations?

Linear diophantine equations have practical applications in fields such as number theory, cryptography, and computer science. They are also used as a tool for solving more complex problems in mathematics and have been studied extensively by mathematicians for centuries.

Can all linear diophantine equations be solved?

Not all linear diophantine equations have integer solutions. Some equations may have no solutions, while others may have infinitely many solutions. The solvability of a linear diophantine equation depends on the coefficients a, b, and c, and can be determined using the Bézout's identity theorem.

Are there any practical applications of linear diophantine equations?

Yes, linear diophantine equations have practical applications in areas such as scheduling and resource allocation, as well as in the development of algorithms for computer programming. They are also used in cryptography for creating and breaking codes.

Similar threads

Replies
5
Views
2K
Replies
4
Views
6K
Replies
1
Views
756
Replies
2
Views
1K
Replies
5
Views
1K
Replies
21
Views
2K
Replies
4
Views
1K
Back
Top