[issue457066] pow(a,b,c) should accept b<0

[Thomas Dybdahl Ahle]

Thomas Dybdahl Ahle <lobais at gmail.com> 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 <report at bugs.python.org>
<http://bugs.python.org/issue457066>
_______________________________________