Quantum Computing.
m is a random integer less than n this periodic function is ƒ(j) = m^j mod n. This expression simply means that ƒ(j) is obtained as the remainder of the division of m^j by n. Finding the value of o, called as well the order of ƒ(j) in n, is the job of the quantum phase of the Shor’s algorithm. If