Pillai's arithmetical function
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 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]
References
[edit | edit source]- ^ a b c Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Sum of GCD(k,n)
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).