Pillai's arithmetical function

From HandWiki

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

  1. 1.0 1.1 1.2 Lászlo Tóth (2010). "A survey of gcd-sum functions". J. Integer Sequences 13. 
  2. Sum of GCD(k,n)
  3. S. S. Pillai (1933). "On an arithmetic function". Annamalai University Journal II: 242–248. 
  4. Broughan, Kevin (2002). "The gcd-sum function". Journal of Integer Sequences 4 (Article 01.2.2): 1-19. 

OEISA018804