Content deleted Content added
Unsourced, added orphan, uncategorised tags using AWB |
propose merge with Modular exponentiation |
||
Line 1:
{{Unsourced|date=October 2014}}
{{Orphan|date=October 2014}}
{{merge|Modular exponentiation}}
We define a ≡ b (mod c) if (a - b)/c is an integer. Define the function f(x, y, z) ≡ x<sup>y</sup> (mod z), such that f ∈ {0, 1, ... , z - 1}. Then w = f(x, y, z) can be computed efficiently, even when x, y, z > 10<sup>300</sup> by the following recursive algorithm (we assume that the integers x > 0, y > -1, and z > 0):
| |||