“…1≤j≤n gcd(j,n)=1 gcd(j − 1, n) = ϕ(n)d(n), valid for every n ∈ N, where d(n) denotes the number of divisors of n. This identity has been generalized in several ways. See, for example [11,12,17,19]. Also, 1≤j≤n gcd(j,n)=1 gcd(j 2 − 1, n) = ϕ(n)h(n),…”