« first day (1113 days earlier)      last day (1272 days later) » 

user21820
user21820
12:38
2
Q: Strange Python Speedup for Modular Inverse

user21820Usually I am lazy and calculate modular inverses as follows: def inv(a,m): return 1 if a==1 else ((a-inv(m%a,a))*m+1)//a print(inv(100**7000,99**7001)) But I was curious to know whether the method of passing more information back, namely the solution to Bezout's theorem (instead of just on...

algorithm performance python-3.x recursion mod
@SimplyBeautifulArt Since you are familiar with fancy Python features, could you have a look at this question I asked 4 years ago? ^
I had completely forgotten about it until someone upvoted it today hahaha..

« first day (1113 days earlier)      last day (1272 days later) »