Quantum Computing.
m¹³ because the last bit is 1. However we still need to compute the remainder of the division by n. For that we can evaluate the remainder of the division by n before each multiplication by m. If m = 11 and n = 21 we have in the example the following steps: ƒ = 1 = 11⁰, ƒ = ƒ mod 21 = 11 mod 21 =