On a conjecture of Deaconescu
Abstract
In 2000 Deaconescu raised a question whether there exists a composite n for which S2(n)|φ(n)-1, where φ(n) is Euler's function and S2(n) is Schemmel's totient function. In this paper we prove that any such n is odd, squarefree and has at least seven distinct prime factors. We also prove that any such n with exactly K distinct prime divisors is necessarily less than 22K+1.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.