Anonymous user
Multiplicative order: Difference between revisions
m
no edit summary
m (→{{header|Tcl}}: fixed broken closing lang tag.) |
mNo edit summary |
||
Line 36:
Finally, for each<tt> i</tt> ,<tt> </tt>repeatedly raise<tt> xi </tt>to the<tt> qi</tt>-th power<tt> (mod p) </tt>(as many as<tt> ei-1 </tt> times), checking to see when 1 is obtained.
This can be done using<tt> O((lg p)<sup>3</sup>) </tt>steps.
The total cost is dominated by<tt> O(k(lg p)<sup>3</sup>)</tt> ,<tt> </tt>which is<tt> O(
=={{header|Ada}}==
| |||