Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-09T15:06:39.813Z Has data issue: false hasContentIssue false

The divisors of p-1

Published online by Cambridge University Press:  26 February 2010

R. R. Hall
Affiliation:
Department of Mathematics, University of York, Heslington, York.
Get access

Extract

Let τ(n; k, h) denote the number of divisors of n which are congruent to h (mod k), and τ(n; k) the number of divisors of n prime to k, so that

Let

Erdős [1] proved that, if ε and η are fixed arbitrary positive numbers, then for almost all integers n ≤ x, we have

provided

Hall and Sudbery [2] showed that it is sufficient that

and apart from the ε, this upper bound for k is best possible, for it is clear that k must not exceed the normal order of τ(n). For n ≤ x, Hardy and Ramanujan [3] showed that this normal order is (log x)log 2 = 2 log log x.

Information

Type
Research Article
Copyright
Copyright © University College London 1973

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable