While considering the summatory function of the Liouville Function, we found that
which takes the value of 1 when n is a perfect square and 0 otherwise. The following question was given as a challenge and we present its solution in this article.
Question
Find
Solution:-
From
∑d|nλ(d)=1PerfectSquare(n)
using the Möbius Inversion formula, we have
∑d|nμ(nd)1PerfectSquare(d)=λ(n)
The summands will be zero except when d=D2. Hence we get
∑D2|nμ(nD2)=λ(n)
[End]
Wednesday, April 13, 2011
Möbius Inversion with Liouville Function
This article concerns Möbius Inversion with the Liouville Function. For n=pa11pa22..., the number of distinct prime factors of n is
Question
(i) Prove that
(ii) Hence show that
Solution:-
(i) Note that for divisors d containing any prime power of index 2 or higher. We only need to consider divisors of the form , where is interpreted as .
=
= (where 1+1+...+1 has h copies of 1)
= = =
= =
(ii) Recall that
From the result in part (i) we multiply both sides by to get
Treating this as the "Möbius Inversed" formula, the "original" formula is
Hence
= =
= = =
[End]
Question
(i) Prove that
(ii) Hence show that
Solution:-
(i) Note that for divisors d containing any prime power of index 2 or higher. We only need to consider divisors of the form , where is interpreted as .
=
= (where 1+1+...+1 has h copies of 1)
= = =
= =
(ii) Recall that
From the result in part (i) we multiply both sides by to get
Treating this as the "Möbius Inversed" formula, the "original" formula is
Hence
= =
= = =
[End]
Liouville Function, Summatory of
We introduced the Liouville function here. The summatory function of is defined as
In this post, we examine the summatory function of the Liouville function.
Question
Prove that
Solution:-
Note that for where p is a prime number,
= =
= =
= = ("Even indicator function")
Hence for
= =
=
=
= =
Challenge: Find , where is the Möbius function. Solution here.
In this post, we examine the summatory function of the Liouville function.
Question
Prove that
Solution:-
Note that for where p is a prime number,
= =
= =
= = ("Even indicator function")
Hence for
= =
=
=
= =
Challenge: Find , where is the Möbius function. Solution here.
Liouville Function - Introduction
The Liouville function, after Joseph Liouville, is defined for as
interpreted so that . It is quite obvious that
This, coupled with the fact that the Liouville function is completely multiplicative (see below), we have
Question
Prove that the Liouville function is completely multiplicative i.e.
for all integers m and n (not necessarily coprime).
Solution:-
Let be the list of primes appearing in m and/or n. Write and , in which any of the non-negative integers and can be zero. Then
Consequently
[End]
More about the Liouville function here, and a result involving Möbius Inversion function here.
interpreted so that . It is quite obvious that
This, coupled with the fact that the Liouville function is completely multiplicative (see below), we have
Question
Prove that the Liouville function is completely multiplicative i.e.
for all integers m and n (not necessarily coprime).
Solution:-
Let be the list of primes appearing in m and/or n. Write and , in which any of the non-negative integers and can be zero. Then
Consequently
[End]
More about the Liouville function here, and a result involving Möbius Inversion function here.
Tuesday, April 12, 2011
Subscribe to:
Posts (Atom)