Scribd
Upload
288 views

Linear Diophantine

This document discusses linear Diophantine equations, which are equations that must be solved over the integers. It provides examples of solving linear Diophantine equations with two and three variables. The key results are that a linear Diophantine equation ax + by = c has solutions if and only if the greatest common divisor (a,b) divides c, and the general solution depends on n-1 parameters for an equation with n variables.

Uploaded by

Singh Sudip
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
288 views

Linear Diophantine

This document discusses linear Diophantine equations, which are equations that must be solved over the integers. It provides examples of solving linear Diophantine equations with two and three variables. The key results are that a linear Diophantine equation ax + by = c has solutions if and only if the greatest common divisor (a,b) divides c, and the general solution depends on n-1 parameters for an equation with n variables.

Uploaded by

Singh Sudip
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

7-17-2008

Linear Diophantine Equations


A Diophantine equation is an equation which is to be solved over the integers. A linear Diophantine equation of the form ax + by = c has solutions if and only if (a, b) | c. There is a similar result for linear Diophantine equations in more than 2 variables.

A Diophantine problem is one in which the solutions are required to be integers. Abusing terminology, Ill refer to Diophantine equations, meaning equations which are to be solved over the integers.

Example. x3 + y 3 = z 3 has many solutions over the reals; for example, x = 1, , y = 1, z= 3 2.

However, this equation has no nonzero integer solutions.

Example. Since (9, 100) = 1, there are integers x and y such that 9x + 100y = 1. For example, 9 (11) + 100 1 = 1, and 9 89 + 100 (8) = 1. That is, the Diophantine equation 9x + 100y = 1 has solutions in fact, innitely many solutions.

Theorem. Let a, b, c Z. Consider the Diophantine equation ax + by = c. (a) If (a, b) | c, there are no solutions. (b) If (a, b) = d | c, there are innitely many solutions of the form x= b k + x0 , d a y = k + y0 . d

Here (x0 , y0 ) is a particular solution, and k Z. Before I give the proof, Ill give some examples, and also discuss the three variable equation ax + by + cz = d.

Example. Solve 6x + 9y = 21. Since (6, 9) = 3 | 21, there are innitely many solutions. By trial and error, x = 7, y = 7, is a particular solution. Hence, the general solution is x = 3k 7, y = 2k + 7.

For example, setting k = 5 produces the solution x = 8, y = 3.

Example. Solve 6x + 9y = 5. Since (6, 9) = 3 | 5, the equation has no solutions. Example. Solve 3x + 3y + 5z = 10. First, Ill factor (3, 3) out of the rst two coecients: (3, 3) 3 3 x+ y + 5z = 10. (3, 3) (3, 3) 3 so that (3, 3)

Notice that (3, 3) = 3, so those two fractions are actually integers. Im not simplifying you can see whats going on. Let w= The equation becomes (3, 3)w + 5z = 10, or 3w + 5z = 10.

3 3 x+ y. (3, 3) (3, 3)

(3, 5) = 1 | 10, so this two variable equation is solvable. w = 5, y = 1, is a particular solution, so the general solution is w = 5s + 5, z = 3s 1. Now I have to nd x and y : w= Thus, x + y = 5s + 5. This is a two variable equation. Since (1, 1) = 1 | 5s + 5, its solvable. x = 5, y = 5s, is a particular solution. Therefore, the general solution is x = t + 5, y = 5s t. 3 3 x+ y, (3, 3) (3, 3) so w = x + y.

All together, the general solution to the original three variable equation is x = t + 5, y = 5s t, z = 3s 1.

In general, if there is a solution to the linear Diophantine equation a1 x1 + an xn = c, the solution will depend on n 1 parameters exactly as youd expect from linear algebra. Proof. (two variable case) Consider the linear Diophantine equation ax + by = c. Case 1. Suppose (a, b) | c. If x and y solve the equation, then (a, b) | ax + by = c. 2

This contradiction shows that there cannot be a solution. Case 2. Suppose (a, b) | c. Write c = k(a, b) for k Z. There are integers m and n such that am + bn = (a, b). Then amk + bnk = (a, b)k = c. Hence, x = km, y = kn, is a solution. Suppose x = x0 , y = y0 , is a particular solution. Then a b k + x0 d a ab ab + b k + y0 = k k + (ax0 + by0 ) = 0 + c = c. d d d

a b k + x0 , y = k + y0 is a solution for every k Z. d d Finally, I want to show that every solution has this form. Suppose then that (x, y ) is a solution. Then ax + by = c and ax0 + by0 = c imply This proves that x = a(x x0 ) + b(y y0 ) = c c = 0. Therefore, b a ( x x0 ) + (y y0 ) = 0, (a, b) (a, b) a b ( x x0 ) = (y y0 ). (a, b) (a, b) Now a divides the left side, so it divides the right side. However, (a, b) a (a, b) Thus, y = y0 + k Substitute this back into the last x-y equation: a b b a ( x x0 ) = (y y0 ) = k , (a, b) (a, b) (a, b) (a, b) x x0 = k x = x0 k b , (a, b) y y0 , or y y0 = k b a , (a, b) (a, b) = 1. Therefore,

a for some k. (a, b)

a . (a, b)

b . (a, b)

This is the result stated in the theorem (with an unimportant switch of k and k.)

c 2008 by Bruce Ikenaga

You might also like