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

DOI10.5486/PMD.2015.7098zbMath1363.11004arXiv1403.7878OpenAlexW2963570021MaRDI QIDQ2834177

C. Calderón, José María Grau, László Tóth, Antonio M. Oller-Marcén

Publication date: 25 November 2016

Published in: Publicationes Mathematicae Debrecen (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.7878

zbMATH Keywords

asymptotic formulamultiplicative functionEuler's totient functionquadratic congruence

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Counting solutions of Diophantine equations (11D45) Arithmetic functions; related numbers; inversion formulas (11A25)

Related Items (3)

Distribution of values of general Euler totient function ⋮ Fast computation of the number of solutions to \(x_1^2 + \cdots + x_k^2 \equiv \lambda \pmod{n}\) ⋮ Counting the solutions of \(\lambda_1 x_1^{k_1} + \dots + \lambda_t x_t^{k_t} \equiv c \bmod n\)

This page was built for publication: Counting invertible sums of squares modulo $n$ and a new generalization of Euler's totient function