document.write( "Question 1019644: Hello we recently learned about diophantine equations and how to use euclidean algorithm to solve it, but i am kind of really stuck!\r
\n" ); document.write( "\n" ); document.write( "find all solutions to each of the following Diophantine equations:
\n" ); document.write( " 24x+63y=99\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "how could i use the algorithm to solve this?
\n" ); document.write( "

Algebra.Com's Answer #636366 by Fombitz(32388)\"\" \"About 
You can put this solution on YOUR website!
First find the GCD using the Euclidean algorithm,
\n" ); document.write( "\"63=2%2A24%2B15\"
\n" ); document.write( "\"24=1%2A15%2B9\"
\n" ); document.write( "\"15=1%2A9%2B6\"
\n" ); document.write( "\"9=1%2A6%2B3\"
\n" ); document.write( "\"6=2%2A3\"
\n" ); document.write( "So \"GCD=3\".
\n" ); document.write( "Using back substitution,
\n" ); document.write( "\"3=9-1%2A6\"
\n" ); document.write( "\"3=9-1%2815-1%2A9%29=15-2%2A9\"
\n" ); document.write( "\"3=15-2%2824-1%2A15%29%29\"
\n" ); document.write( "\"3=8%2A24-3%2A63\"
\n" ); document.write( "So then,
\n" ); document.write( "\"n=8\"
\n" ); document.write( "\"m=-3\"
\n" ); document.write( "\"a=24\"
\n" ); document.write( "\"b=63\"
\n" ); document.write( "\"c=99\"
\n" ); document.write( "\"GCD=3\"
\n" ); document.write( "
\n" ); document.write( "
\n" );