English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

Prove that if gcd ( a ,b ) divides c , the eqaution has infinitly many solutions .Can you show this step by step . Thanks !

2007-07-16 01:03:13 · 2 answers · asked by Arithmetica 1 in Science & Mathematics Mathematics

2 answers

It would be easier to take an example
2x+3y=5
x=2-y +(1-y)/2 ( you make the division and write the remainder)
(1-y)/2 =t so y=1-2t
and x= 2-1+2t+t = 1+3t
Now giving t integer values you get infinite solutions
By Euclydes you must come to this type of expressions

2007-07-16 01:40:14 · answer #1 · answered by santmann2002 7 · 0 0

I suggest you take a look at

http://mathworld.wolfram.com/DiophantineEquation.html

It's interesting.

2007-07-16 02:57:16 · answer #2 · answered by Steiner 7 · 0 0

fedest.com, questions and answers