Abstract
In this paper we introduce and study a family of arithmetic functions generalizing Euler's totient function. These functions are given by the number of solutions to the equation with which, for and coincide, respectively, with the number of units in the rings of Gaussian integers, quaternions and octonions over . We prove that is multiplicative for every , we obtain an explicit formula for in terms of the prime-power decomposition of and derive an asymptotic formula for . As a tool we investigate the multiplicative arithmetic function that counts the number of solutions to (mod ) for coprime to , thus extending an old result that dealt only with the prime case.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.