In number theory, the gcd-sum function, also called Pillai's arithmetical function, is defined for every n{\displaystyle n} by
or equivalently
where d{\displaystyle d} is a divisor of n{\displaystyle n} and φ{\displaystyle \varphi } is Euler's totient function.
it also can be written as