Vol. 69, No. 1, 1977

Download this article
Download this article. For screen
For printing
Recent Issues
Vol. 294: 1
Vol. 293: 1  2
Vol. 292: 1  2
Vol. 291: 1  2
Vol. 290: 1  2
Vol. 289: 1  2
Vol. 288: 1  2
Vol. 287: 1  2
Online Archive
Volume:
Issue:
     
The Journal
Subscriptions
Editorial Board
Officers
Special Issues
Submission Guidelines
Submission Form
Contacts
Author Index
To Appear
 
ISSN: 0030-8730
On composite n for which φ(n)n 1. II

Carl Pomerance

Vol. 69 (1977), No. 1, 177–186
Abstract

The problem of whether there exists a composite n for which φ(n)n 1 (φ is Euler’s function) was first posed by D. H. Lehmer in 1932 and still remains unsolved. In this paper we prove that the number of such n not exceeding x is O(x12(log x)34). We also prove that any such n with precisely K distinct prime factors is necessarily less than K2K . There are appropriate generalizations of these results to integers n for which φ(n)n a, a an arbitrary integer.

Mathematical Subject Classification
Primary: 10A20, 10A20
Milestones
Received: 28 October 1975
Published: 1 March 1977
Authors
Carl Pomerance
Mathematics Department
Dartmouth College
Kemeny Hall
Hanover NH 03755
United States
www.math.dartmouth.edu/~carlp