Ask your own question, for FREE!
Discrete Math 12 Online
OpenStudy (rational):

HELP!! Mobius inversion stuff http://prntscr.com/4hqi84

OpenStudy (across):

Use induction and the definition of \(\mu\).

OpenStudy (rational):

\[\mu = \begin{cases} 1 & if~ n=1\\0 & \text{n is not square free} \\(-1)^r& \text{otherwise} \end{cases}\]

OpenStudy (across):

That is not the definition of \(\mu\) as I know it. :-/

OpenStudy (ikram002p):

it is across :) see above it says Mobius inversion

OpenStudy (across):

So, \(\mu\) is not the Mobius function?

OpenStudy (rational):

it is Mobius function, let me take a snapshot and attach... looks I have messed up the meaning ;-;

OpenStudy (rational):

here is the definition of \(\large \mu\) function from my textbook http://prntscr.com/4hqmak

OpenStudy (ikram002p):

it is -.- but it name mubius \(\mu\) function , what the function you know across ?

OpenStudy (ikram002p):

ok so , we need to prove one of them =0

OpenStudy (rational):

I think the same symbol is used in different branches... when I searched i got multiple confusing definitions earlier

OpenStudy (ikram002p):

for n n+1 n+2 n+3 at least of of them should have \(p^2\) divisor .

OpenStudy (ikram002p):

mu is used every where , and there is several functions with mobius name but there is only one function name mobius mu function :o

OpenStudy (rational):

can we use this there will be exactly TWO even numbers in a set of 4 consecitive integers ?

OpenStudy (rational):

so the product of any four consecutive numbers is always NOT square free... this should conclude the proof ?

OpenStudy (ikram002p):

exactly :) one of them would divid 4 :o bhahaha cool

OpenStudy (ikram002p):

done , it is a proof :)

OpenStudy (rational):

that was easy :) part b looks scary though >.<

OpenStudy (ikram002p):

its multiplicative function

OpenStudy (rational):

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) \]

OpenStudy (rational):

next what

OpenStudy (ikram002p):

\(\mu(k!)=0\) for k>=4

OpenStudy (rational):

Oh yes got it :)

OpenStudy (ikram002p):

got it all ?

OpenStudy (ikram002p):

so we only need to show that \(\mu (1!) +\mu (2!)+\mu (3!)=1\)

OpenStudy (rational):

\[\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}\]

OpenStudy (rational):

nice :)

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!