# Math Help - Help proving Moreau's formula

1. ## Help proving Moreau's formula

Hi, Im trying to prove moreau's formula but having alot of difficulty.

Ive been told to use Moebius ( Mobius ) inversion and Burnside's formula, but i dont even know where to start.

Any tips/hints or links to start me in the right direction would really be appreciated. The original problem is the Necklace Counting problem.

Thanks

2. What is Moreau's formula? We can't help you enless you tell us what you want to prove.

3. ## Moreau's

Moreau's formula is

M(a,n) = 1/n SUM_d|n ( mobius function(n/d) ) a^d
http://en.wikipedia.org/wiki/Moreau%...nting_function

where the mobius function is found here
http://en.wikipedia.org/wiki/M%C3%B6bius_function

and burnside's
http://en.wikipedia.org/wiki/Burnside%27s_lemma

I have been told to use the mobius inversion and burnsides formula to give a general proof of the moreau function.