<Li> Shor's algorithm, for quantum computers </Li> <P> In number theory, there are many integer factoring algorithms that heuristically have expected running time </P> <Dl> <Dd> L n (1 2, 1 + o (1)) = e (1 + o (1)) (log ⁡ n) (log ⁡ log ⁡ n) (\ displaystyle L_ (n) \ left ((\ tfrac (1) (2)), 1 + o (1) \ right) = e ^ ((1 + o (1)) (\ sqrt ((\ log n) (\ log \ log n))))) </Dd> </Dl> <Dd> L n (1 2, 1 + o (1)) = e (1 + o (1)) (log ⁡ n) (log ⁡ log ⁡ n) (\ displaystyle L_ (n) \ left ((\ tfrac (1) (2)), 1 + o (1) \ right) = e ^ ((1 + o (1)) (\ sqrt ((\ log n) (\ log \ log n))))) </Dd>

Factor 69 into a product of its primes