11 - (i) The linear Diophantine Equation ax + by = c has a...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Theorem. Let a, b, c Z . If c | ab and gcd ( a, c ) = 1, then c | b . Proof. Since gcd ( a, c ) = 1, there exist x, y Z s.t. 1 = ax + cy. Then b = ( ab ) x + cby. Since c | ( ab ) and c | ( cb ), we have c | b. 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Linear Diophantine Equations of one variable: ax = b, where a, b Z are given, a 6 = 0, x Z is a variable. of two variables: ax + by = c, where a, b, c Z are given, a 6 = 0 , b 6 = 0, x, y Z are variables. 2
Background image of page 2
Linear Diophantine Equation Theorem.
Background image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: (i) The linear Diophantine Equation ax + by = c has a solution if and only if gcd( a, b ) | c. (ii) If x = x and y = y is one particular solu-tion, then the complete solution is x = x + m b d , y = y-m a d for all m Z . 3...
View Full Document

Page1 / 3

11 - (i) The linear Diophantine Equation ax + by = c has a...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online