2000 character limit reached
A Generalization of A Result of Gauss on Primitive Root
Published 19 Nov 2019 in math.NT | (1911.08176v1)
Abstract: A primitive root modulo an integer $n$ is the generator of the multiplicative group of integers modulo $n$. Gauss proved that for any prime number $p$ greater than $3$, the sum of its primitive roots is congruent to $1$ modulo $p$ while its product is congruent to $\mu(p-1)$ modulo $p$, where $\mu$ is the M\"{o}bius function. In this paper, we will generalize these two interesting congruences and give the congruences of the sum and the product of integers with the same index modulo $n$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.