Counting invertible sums of squares modulo $n$ and a new generalization of Euler's totient function

Abstract

In this paper we introduce and study a family Φ k of arithmetic functions generalizing Euler's totient function. These functions are given by the number of solutions to the equation gcd(