Pillai's arithmetical function

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In number theory, the gcd-sum function,[1] also called Pillai's arithmetical function,[1] is defined for every n by

P(n)=k=1ngcd(k,n)

or equivalently[1]

P(n)=dndφ(n/d)

where d is a divisor of n and φ is Euler's totient function.

it also can be written as[2]

P(n)=dndτ(d)μ(n/d)

where, τ is the divisor function, and μ is the Möbius function.

This multiplicative arithmetical function was introduced by the Indian mathematician Subbayya Sivasankaranarayana Pillai in 1933.[3]

[4]

References

[edit | edit source]
  1. ^ a b c Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  2. ^ Sum of GCD(k,n)
  3. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  4. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).

(sequence A018804 in the OEIS)