document.write( "Question 1019647: This diophantine equation seems impossible for me..\r
\n" );
document.write( "\n" );
document.write( "\"A dealer spent $10000 buying cattle, some at $410 each and the rest at $530 each. How many of each sort did she buy?\" \r
\n" );
document.write( "\n" );
document.write( "I made a diophantine equation for this.. \r
\n" );
document.write( "\n" );
document.write( "\r
\n" );
document.write( "\n" );
document.write( "simplifies to:\r
\n" );
document.write( "\n" );
document.write( "\r
\n" );
document.write( "\n" );
document.write( "i seem to have most trouble when the c is the biggest number in the equation in ax+by=c\r
\n" );
document.write( "
\n" );
document.write( "\n" );
document.write( "I tried using euclid's algorithm but it doesnt seem to work for me, i think im using it wrong..\r
\n" );
document.write( "\n" );
document.write( "Any help to the question would be helpful. \n" );
document.write( "
Algebra.Com's Answer #635611 by robertb(5830)![]() ![]() You can put this solution on YOUR website! Sometimes it is easier to solve a math problem by brute force, especially when the values we expect to get are moderate, positive values.\r \n" ); document.write( "\n" ); document.write( "By a little trial and error, a particular solution to the Diophantine equation is x = 5 and y = 15.\r \n" ); document.write( "\n" ); document.write( "(BTW, A Diophantine equation ax+by = c has solutions if and only if gcd(a,b) divides c. If so, it has infinitely many solutions, and any one solution can be used to generate all the other ones.) \n" ); document.write( " |