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

HELP! Mobius inversion formula http://prntscr.com/4hqt9l

OpenStudy (rational):

using the hint, I should begin with\[\large \begin{align}\\ \sum \limits_{d|n} \Lambda(d) = \end{align} \]

OpenStudy (rational):

Since all divisors vanish except single prime powers : \[\large \begin{align}\\ \sum \limits_{d|n} \Lambda(d) &= \sum \limits_{p^i|n} \Lambda(p^i) \end{align}\]

OpenStudy (ikram002p):

will try some other time , gn

OpenStudy (rational):

gn

OpenStudy (rational):

\[\large \begin{align}\\ \sum \limits_{d|n} \Lambda(d) &= \sum \limits_{p^i|n} \Lambda(p^i) \\~\\ &=\log(p_1) + \log(p_1) + \cdots + \log (p_r)~~\\&\color{gray}{\text{(gives prime factorization of n)}}~\\~\\ &=\log(p_1^{e_1}p_2^{e_2}\cdots p_r^{e^r})\\~\\ &= \log (n) \end{align}\]

OpenStudy (rational):

apealing to mobius inversion formula \[\large F(n) = \sum \limits_{d|n}f(d) \implies f(n) = \sum \limits_{d|n}\mu(d)F(n/d)\] gives \[\large \log (n) = \sum \limits_{d|n}\Lambda (d) \implies \Lambda(n) = \sum \limits_{d|n}\mu(d)\log(n/d)\]

OpenStudy (ikram002p):

first part is awesome , i dint get second part :o

OpenStudy (rational):

i have just applied the mobius inversion formula

OpenStudy (anonymous):

but we wanna u(n/d) u(d) right ?

OpenStudy (anonymous):

u(n/d) log d

OpenStudy (anonymous):

hmmm , not sure still brain freazing >.<

OpenStudy (rational):

?

OpenStudy (rational):

from the first part we have this : \[\large \log (n) =\sum \limits_{d|n} \Lambda(d) \]

OpenStudy (rational):

apply mobius inversion formula, what do u get ?

OpenStudy (anonymous):

\sum u(d)log(n/d)

OpenStudy (rational):

yes, so we're done right ?

OpenStudy (anonymous):

how ;_;

OpenStudy (anonymous):

http://prntscr.com/4i1hj3

OpenStudy (rational):

d is just a dummy variable : as "d runs through n", "n/d runs through n" too

OpenStudy (anonymous):

and negative sighn ?

OpenStudy (rational):

so \[\large \begin{array}\\ \log (n) = \sum \limits_{d|n}\Lambda (d) \implies \Lambda(n) &= \sum \limits_{d|n}\mu(d)\log(n/d) \\~\\ &= \sum \limits_{d|n}\mu(n/d)\log(d) \\~\\ \end{array}\]

OpenStudy (rational):

fine with this ?

OpenStudy (anonymous):

yeah

OpenStudy (rational):

lets work the second equality

OpenStudy (rational):

\[\large \begin{array}\\ \log (n) = \sum \limits_{d|n}\Lambda (d) \implies \Lambda(n) &= \sum \limits_{d|n}\mu(d)\log(n/d) \\~\\ &= \\~\\\end{array}\]

OpenStudy (rational):

expand log(n/d) = log(n) - log(d)

OpenStudy (rational):

\[\large \begin{array}\\ \log (n) = \sum \limits_{d|n}\Lambda (d) \implies \Lambda(n) &= \sum \limits_{d|n}\mu(d)\log(n/d) \\~\\ &= \sum \limits_{d|n}\mu(d)\left[\log(n) - \log(d) \right] \\~\\\end{array}\]

OpenStudy (rational):

and remember this result : \[\large \begin{array}\\ \sum \limits_{d|n}\mu(d) = 0 \\~\\ \end{array}\]

OpenStudy (anonymous):

oh :o

OpenStudy (rational):

\[ \large \begin{array}\\ \log (n) = \sum \limits_{d|n}\Lambda (d) \implies \Lambda(n) &= \sum \limits_{d|n}\mu(d)\log(n/d) \\~\\ &= \sum \limits_{d|n}\mu(d)\left[\log(n) - \log(d) \right] \\~\\ &= \sum \limits_{d|n}\mu(d) \log(n) - \sum \limits_{d|n}\mu(d) \log(d) \\~\\ &= \log(n)\sum \limits_{d|n}\mu(d) - \sum \limits_{d|n}\mu(d) \log(d) \\~\\ &= 0 - \sum \limits_{d|n}\mu(d) \log(d) \\~\\ \end{array} \]

OpenStudy (anonymous):

ohhh !!

OpenStudy (rational):

im not dude

OpenStudy (anonymous):

ermm ok -.- sry

OpenStudy (anonymous):

i dnt even know what does that mean, really sry

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!