Jump to content

Pillai's arithmetical function

From Wikipedia, the free encyclopedia
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

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

or equivalently[1]

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

it also can be written as[2]

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. ^ a b c 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