« first day (1192 days earlier)      last day (3476 days later) » 

7:59 PM
May I interest anyone in a Code Review question?
7
Q: Modular Exponentiation

JuicyI want to solve the following for \$x\$ (in Python): \$x^{101} = 8765 \ (\mod{9691573})\$ I coded this: n = 8765 power = 101 mod = 9691573 x = 0 while x < mod: if (x ** power) % mod == n: break x += 1 print x This is basically the "brute force" approach. What is the most e...

 

« first day (1192 days earlier)      last day (3476 days later) »