Given a positive integer n. Show that
n=∑k[√nk]
where k runs through the square free numbers, 1≤k≤n and [x] is the integer part of x.
Solution:
If λ is the Lioville function: λ(pa)=(−1)a for prime powers and λ(ab)=λ(a)λ(b) for co-prime a,b
then using dirichlet convolution we have the identity λ∗1=s, where s is the indicator function for perfect squares.
We can also show that the dirichlet inverse of λ is μ2, where μ is the mobius function.
Thus we have 1=λ−1∗s
Which gives (using summation identities involving dirichlet convolution)
n=∑1≤k≤nμ2(k)S(n/k)
where S(n/k) counts the number of perfects squares ≤nk, which is in fact [√nk].
μ(k) is non-zero only for the square free numbers, and that proves the identity,
No comments:
Post a Comment