Avik Sarkar ssavi
ssavi
/ euler_phi.cpp
Created
January 22, 2017 05:32
— forked from cslarsen/euler_phi.cpp
Euler's totient function phi --- a fast implementation in C++
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* | |
| * Euler's totient function phi(n). | |
| * http://en.wikipedia.org/wiki/Euler%27s_totient_function | |
| * | |
| * This is an *EXTREMELY* fast function and uses | |
| * several tricks to recurse. | |
| * | |
| * It assumes you have a list of primes and a fast | |
| * isprime() function. Typically, you use a bitset | |
| * to implement the sieve of Eratosthenes and use |