➜

This issue tracker has been migrated to GitHub, and is currently read-only.
For more information, see the GitHub FAQs in the Python's Developer Guide.

Author thomasahle
Recipients gvanrossum, phr, thomasahle, tim.peters
Date 2012-01-22.09:24:14
SpamBayes Score 2.0938087e-05
Marked as misclassified No
Message-id <1327224255.45.0.632221812206.issue457066@psf.upfronthosting.co.za>
In-reply-to
Content 
For anyone who finds this through google,
if you are finding the inverse mod a prime, you can use fermats little theorem: pow(a, -1, mod) = pow(a, a-2, mod).
(You also need that mod doesn't divide a).
History
Date User Action Args
2012-01-22 09:24:15thomasahlesetrecipients: + thomasahle, gvanrossum, tim.peters, phr
2012-01-22 09:24:15thomasahlesetmessageid: <1327224255.45.0.632221812206.issue457066@psf.upfronthosting.co.za>
2012-01-22 09:24:14thomasahlelinkissue457066 messages
2012-01-22 09:24:14thomasahlecreate