HELP! Mobius inversion formula http://prntscr.com/4hqt9l
using the hint, I should begin with\[\large \begin{align}\\ \sum \limits_{d|n} \Lambda(d) = \end{align} \]
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}\]
will try some other time , gn
gn
\[\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}\]
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)\]
first part is awesome , i dint get second part :o
i have just applied the mobius inversion formula
but we wanna u(n/d) u(d) right ?
u(n/d) log d
hmmm , not sure still brain freazing >.<
?
from the first part we have this : \[\large \log (n) =\sum \limits_{d|n} \Lambda(d) \]
apply mobius inversion formula, what do u get ?
\sum u(d)log(n/d)
yes, so we're done right ?
how ;_;
d is just a dummy variable : as "d runs through n", "n/d runs through n" too
and negative sighn ?
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}\]
fine with this ?
yeah
lets work the second equality
\[\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}\]
expand log(n/d) = log(n) - log(d)
\[\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}\]
and remember this result : \[\large \begin{array}\\ \sum \limits_{d|n}\mu(d) = 0 \\~\\ \end{array}\]
oh :o
\[ \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} \]
ohhh !!
im not dude
ermm ok -.- sry
i dnt even know what does that mean, really sry
Join our real-time social learning platform and learn together with your friends!