Thread: question
View Single Post
Old 2009-07-06, 07:41   #5
davieddy's Avatar
Dec 2006

2×3×13×83 Posts

Originally Posted by ATH View Post
Thanks, it was just something like this I was looking for:

(2kp+1)=0 (mod q) => 2kp+1= c*q => c*q - 2kp = 1

Then I can find c and more importantly -2*k my using the algorithm on GCD(p,q). Allready tested it and it works great.
If you did GCD(2p,q) you'd get -k. Is this any improvement?

I see Davar55 has revived that embarrassing thread I cited in
the Math forum!

Last fiddled with by davieddy on 2009-07-06 at 07:42
davieddy is offline   Reply With Quote