Thread: question
View Single Post
Old 2009-07-05, 00:22   #1
ATH's Avatar
Dec 2003

3,413 Posts
Default question

Its not really homework, just something I'm wondering about.

Given 2 primes p and q I want to find the smallest k>0 so (2*k*p+1) = 0 (mod q)

Is there any faster way than trying all k from 1 until you find one that works?

Last fiddled with by ATH on 2009-07-05 at 00:22
ATH is offline   Reply With Quote