Talk:High School Mathematics Extensions/Further Modular Arithmetic

Thankyou for taking the time to create such a great resource on number theory. Would it be possible for a proof of the euler totient function formula (for a composite number) to be added in the future?

Shor's Algorithm
The two-torsion factorization section says that there is no known efficient all purpose algorithm for factoring a number into prime factors. But there's Shor's Algorithm, a quantum computer exclusive algorithm which is efficient and essentially all purpose (it doesn't do prime powers, but you can use considerably simpler algorithms for those). Shor's Algorithm also does eventually factor the number through a two-torsion element. Is it worth a mention? -- Giematt (discuss • contribs) 22:49, 28 May 2013 (UTC)