Type: Article
Publication Date: 2005-11-29
Citations: 2
DOI: https://doi.org/10.1017/s0017089505002752
HTML view is not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button. Let $\varphi(\cdot)$ denote the Euler function, and let $a>1$ be a fixed integer. We study several divisibility conditions which exhibit typographical similarity with the standard formulation of the Euler theorem, such as $a^n \equiv 1\!\!\!\!\pmod{\varphi(n)}$, and we estimate the number of positive integers $n\le x$ satisfying these conditions.