HELP!! Mobius inversion stuff http://prntscr.com/4hqi84
Use induction and the definition of \(\mu\).
\[\mu = \begin{cases} 1 & if~ n=1\\0 & \text{n is not square free} \\(-1)^r& \text{otherwise} \end{cases}\]
That is not the definition of \(\mu\) as I know it. :-/
it is across :) see above it says Mobius inversion
So, \(\mu\) is not the Mobius function?
it is Mobius function, let me take a snapshot and attach... looks I have messed up the meaning ;-;
here is the definition of \(\large \mu\) function from my textbook http://prntscr.com/4hqmak
it is -.- but it name mubius \(\mu\) function , what the function you know across ?
ok so , we need to prove one of them =0
I think the same symbol is used in different branches... when I searched i got multiple confusing definitions earlier
for n n+1 n+2 n+3 at least of of them should have \(p^2\) divisor .
mu is used every where , and there is several functions with mobius name but there is only one function name mobius mu function :o
can we use this there will be exactly TWO even numbers in a set of 4 consecitive integers ?
so the product of any four consecutive numbers is always NOT square free... this should conclude the proof ?
exactly :) one of them would divid 4 :o bhahaha cool
done , it is a proof :)
that was easy :) part b looks scary though >.<
its multiplicative function
Alright, since its multiplicative we can write \[\large \sum \limits_{k=1}^n\mu(k!) = \sum \limits_{k=1}^n\left(\mu(1)*\mu(2)*\cdots \mu(k)\right) \]
next what
\(\mu(k!)=0\) for k>=4
Oh yes got it :)
got it all ?
so we only need to show that \(\mu (1!) +\mu (2!)+\mu (3!)=1\)
\[\large \begin{align} \\ \sum \limits_{k=1}^n\mu(k!) &= \sum \limits_{k=1}^n\left(\mu(1)*\mu(2)*\cdots \mu(k)\right) \\~\\ &= \sum \limits_{k=1}^3\left(\mu(1)*\mu(2)*\cdots \mu(k)\right) + 0 \end{align}\]
nice :)
Join our real-time social learning platform and learn together with your friends!