Skip to content
monicanagent edited this page Nov 17, 2014 · 2 revisions

Calculates Euler's totient, or phi(n), using BigInt arbitrary-length integers. Adapted from Alexei Kourbatov's JavaScript implementation (http://www.javascripter.net/math/calculators/eulertotientfunction.htm).

Source code and inline documentation: https://github.com/monicanagent/cypherpoker/blob/master/Libraries/P2P3/CryptoWorker/src/crypto/math/EulerTotient.as

Clone this wiki locally