Counting invertible sums of squares modulo nn and a new generalization of Euler totient function

preprint2014arXivOpen access

Abstract

In this paper we introduce and study a family ΦkΦ_k of arithmetic functions generalizing Euler's totient function. These functions are given by the number of solutions to the equation gcd⁡(x12+…+xk2,n)=1\gcd(x_1^2+\ldots +x_k^2, n)=1 with x1,…,xk∈Z/nZx_1,\ldots,x_k \in {\mathbb{Z}}/n{\mathbb{Z}} which, for k=2,4k=2,4 and 88 coincide, respectively, with the number of units in the rings of Gaussian integers, quaternions and octonions over Z/nZ{\mathbb{Z}}/n{\mathbb{Z}}. We prove that ΦkΦ_k is multiplicative for every kk, we obtain an explicit formula for Φk(n)Φ_k(n) in terms of the prime-power decomposition of nn and derive an asymptotic formula for ∑n≤xΦk(n)\sum_{n\le x} Φ_k(n). As a tool we investigate the multiplicative arithmetic function that counts the number of solutions to x12+…+xk2≡λx_1^2+\ldots +x_k^2\equiv λ (mod nn) for λλ coprime to nn, thus extending an old result that dealt only with the prime nn case.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.