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 20090705 at 00:22
