Hello, I think perhaps you can try to search "reduction LLL" and you will find an algorithm to find the smallest conveniant integers.
Best regards, Denis > > > Do you know if there is a program or a published technique to solve > > equations of the form: > > > > x=a*y/b+c*z/d+e*w/f > > > > where x,y,z,w are real decimal numbers of very high accuracy and > > a,b,c,d,e,f are integers (probably primes). I think this is equivalent to > > > > n*x=a*y+c*z+e*w > > > > where n is a large factorial. > > > > Thanks, > > > > David > > _______________________________________________ > > Prime mailing list > > [email protected] > > http://hogranch.com/mailman/listinfo/prime > > > > _______________________________________________ > Prime mailing list > [email protected] > http://hogranch.com/mailman/listinfo/prime > _______________________________________________ Prime mailing list [email protected] http://hogranch.com/mailman/listinfo/prime
