Anonymous user
Talk:Multiplicative order: Difference between revisions
Provide reference to 100x faster Python code
(→Clarification: response) |
(Provide reference to 100x faster Python code) |
||
Line 106:
:You're allowed to fix it too if you know how. No one will be angry. --[[User:Mwn3d|Mwn3d]] 09:43, 8 December 2007 (MST)
=== Python solution ===
Python "multOrder()" code is nice and self-contained. I happily used it until being pointed to sympy "n_order()". For multOrder(2, 2**41+3) timeit reports 33.6ms, for n_order(2, 2**41+3) timeit reports 206us (on a Raspberry Pi4B). sympy "n_order()" seems to work similar to "multOrder()", just 100x faster:
https://github.com/sympy/sympy/blob/46e00feeef5204d896a2fbec65390bd4145c3902/sympy/ntheory/residue_ntheory.py#L13-L53
--[[User:HermannSW|HermannSW]] ([[User talk:HermannSW|talk]]) 12:19, 2 August 2021 (UTC)
| |||