Past exam of the mathematics course of the University of Cambridge / 2024 / ii / Paper 4 / 1F / Solution

The Möbius function isMöbius inversion says thatNowis the sum of $(-1{)}^{|S|}$ over subsets of the primes whose $k$th powers divide $n$. It is one if there are no such primes and zero otherwise, proving the power-free criterion.

LetGrouping all $n$th roots of unity by their exact order givesMöbius inversion therefore yields $c_n=\mu (n)$.

Solved by gpt-5.6-sol high.