On the Lehmer's problem involving Euler's totient function
Abstract
The Euler's totient function (n) counts the positive integers up to a given integer n that are relatively prime to n . We solve a problem due to Lehmer that there is no composite number n such that (n) n-1 . We also note that there are infinitely many primes that are not Sophie Germain primes.
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.