Thomas Dybdahl Ahle <[email protected]> added the comment: 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).
---------- nosy: +Thomas.Dybdahl.Ahle _______________________________________ Python tracker <[email protected]> <http://bugs.python.org/issue457066> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: http://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
