Definition: Compute the nth power of an expression in Θ(log n) steps by repeatedly squaring an intermediate result and multiplying an accumulating value by the intermediate result when appropriate.
Note: To find x13 one could multiple 13 x's together. This is slow if multiplication is time consuming (e.g., matrix multiplication) or the exponent is very large.
Instead, write the exponent in binary notation.
13 = 1101Start with a "squares" value (s) equal x and an "accumulated" value (a) equal 1. Reading from least significant bit to most significant, when there is a 1 in the binary notation, multiply a by s. Keep squaring s.
|Least significant bit of exponent is 1, so multiply a = a * s|
|Next bit is 0, so don't multiply|
|Next bit is 1, so multiply|
|Highest bit is 1, so multiply|
Why does this work? Consider the exponent decomposed into binary notation.
x13 = x1101The values to be multiplied are successive squares (variable s above). By multiplying appropriate powers, we can compute an integral power in logarithmic time.
= x(1*2^3 + 1*2^2 + 0*2^1 + 1*2^0)
= x1*2^3* x1*2^2* x0*2^1* x1*2^0
= x2^3 * x2^2 * 1 * x2^0
= x8 * x4 * x1
There are many variations. For instance, to find an mod m for very large n, reduce modulo m along the way. Fibonacci numbers can be computed quickly by repeated squaring of a suitable expression. If addition and doubling were much faster than multiplication, one could multiply by repeatedly doubling and summing.
How do you compute 1415^13 mod 2537 with a calculator? (PDF). To work out powers mod n, use repeated squaring.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 12 June 2013.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "repeated squaring", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 12 June 2013. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/repeatedSquaring.html