Join
Lehmer's totient problem
Decide whether some composite number n has Euler's totient φ(n) dividing n − 1, as every prime does.
Comparing changes
Choose two branches to see what changed, then open a pull request to bring the work across.
Pick two different branches
A pull request can go from any branch into any other.