Hi Pascal.

02-Apr-04 15:58:14, Pascal Schmidt wrote to Jasen Betts


 PS> Hi Jasen! :-)

 JB>> A*B=P

 JB>> I was planning on trying squares G   in P-G until I got a square
 JB>> result for G-P  then I'd have  C=G and D=G-P  and from that
 JB>> determine A and B


 PS> I don't think that checking a sequence of numbers for being a
 PS> square is faster than just trying all A*B combinations.

I figured squares in D would be easier to find than primes to put in for A
and B. (not using primes could be slower... using mostly-primes could work
I guess)

I've not looked closely at the binary implementation of SQRT.
but IIRC the best implementation is O(n*log(n)) (for n bits)

 -=> Bye <=-

---