Posts

Liouville’s function λ(n) : Number Theory #Liouville’s #function #λ(n) #: #Number #Theory

Image
                Liouville’s function λ (n) :                    We define λ(n) =   1                             if n = 1                                          = ( -1 ) a1+a2+…+ak        if n = p 1 a1 . p 2 a2 . … . p k ak Note :            Liouville's function Λ (n) is an important example of a completely multiplicative            function. Theorem :                  For every n ≥ 1 , we have 𝜮  λ(d)  =   1    if n is a s...

Multiplicative Functions : Number Theory #Multiplicative #Functions #Number #Theory

Image
  Multiplicative functions   :              Definition :   ( Multiplicative function )                                                                An arithmetical function f is called multiplicative if f is not identically zero and if f (mn) = f(m)f(n) whenever (m,n) = 1.         Definition :   ( completely multiplicative function )                                       ...

Dirichlet Multiplication : Number Theory #Dirichlet #Multiplication #: #Number #Theory

Image
The Dirichlet product of arithmetical functions :    Definition :                    If f and g are two arithmetical functions then we define their Dirichlet product ( or Dirichlet convolution )  to be the arithmetical function f *g  defined by the equation     (f * g)(n) = 𝜮 f(d) g(n/d) for d/n Notation :               The symbol N will be used for the arithmetical function for which N(n) = n ∀ n.     From this notation , we can relate the Mobius function ( 𝝁 ) and Euler totient function ( Ჶ ) by        Ჶ = 𝝁 * N. Note :              The Concept Dirichlet  multiplication helps clarify interrelations between various arithmetical                    functions. Result :              Dirichlet multiplication is commuta...

The Mangoldt Function ⴷ ( n ) : Number Theory #The #Mangoldt #Function #ⴷ ( n ) : #Number #Theory

Image
 Mangoldt Function :  Definition             For every n ≥ 1 we define                       ⴷ ( n )  =  { log p    if n = p m for some  prime p and some m   ≥ 1              =  0    Otherwise    Since 1, 6, 10 can not be expressed as prime power , ⴷ( 0) = ⴷ(6) = ⴷ(10 ) = 0.     For n = 2, we have 2 = 2 1 = P m , here m = 1                 ∴    ⴷ ( 2 ) = log 2.     For n = 3 , we have 3 = 3 1 = p m , here m = 1                   ∴   ⴷ ( 3 ) = log 3     For n = 4, we have 4 = 2 2 = p m , here m = 2        ...