Date: Oct 12, 2012 5:21 AM
Subject: solving diophantine equations with large coefficients
Wolfram alpha can handle Diophantine equations like: (-1643504112940888-1592262977563275 x)/(-1592262858699405+202 x)=y pretty easily and can find Integer solutions.But when the coefficients have more digits, it cannot find Integer solutions.
Solving Diophantine equations like the above with large coefficients require factorization of a very large number which takes lot of time.
Is there another way to find integer solutions for equations like the above?
Thanks in advance...