Hostname: page-component-586b7cd67f-dsjbd Total loading time: 0 Render date: 2024-11-29T19:00:12.004Z Has data issue: false hasContentIssue false
  • English
  • Français

Odd perfect numbers

Published online by Cambridge University Press:  24 October 2008

D. R. Heath-Brown
D. R. Heath-Brown
Affiliation:
Magdalen College, Oxford
Get access Rights & Permissions [Opens in a new window]

Extract

It is not known whether or not odd perfect numbers can exist. However it is known that there is no such number below 10300 (see Brent[1]). Moreover it has been proved by Hagis[4]and Chein[2] independently that an odd perfect number must have at least 8 prime factors. In fact results of this latter type can in priniciple be obtained solely by calculation, in view of the result of Pomerance[6] who showed that if N is an odd perfect number with at most k prime factors, then

Pomerance's work was preceded by a theorem of Dickson[3]showing that there can be only a finite number of such N. Clearly however the above bound is vastly too large to be of any practical use. The principal object of the present paper is to sharpen the estimate (1). Indeed we shall handle odd ‘multiply perfect’ numbers in general, as did Kanold[5], who extended Dickson's work, and Pomerance. Our result is the following.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 115 , Issue 2 , March 1994 , pp. 191 - 196
Copyright
Copyright © Cambridge Philosophical Society 1994

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.)

References

REFERENCES

[1]Brent, R. P.. Improved techniques for odd perfect numbers. Math. Comp. 57 (1991), 857–868.Google Scholar
[2]Chein, J. E. Z.. An odd perfect number has at least 8 prime factors. Ph.D. thesis, Pennsylvania State University, 1979.Google Scholar
[3]Dickson, L. E.. Finiteness of odd perfect and primitive abundant numbers with n distinct prime factors. Amer. J. Math. 35 (1913), 413–426.Google Scholar
[4]Hagis, P.. Outline of a proof that every odd perfect number has at least 8 prime factors. Math. Comp. 35 (1980), 1027–1032.Google Scholar
[5]Kanold, H.-J.. Über einen Satz von L. E. Dickson. Math. Ann. 132 (1956), 246–255.CrossRefGoogle Scholar
[6]Pomerance, C.. Multiply perfect numbers, Mersenne primes, and effective computability. Math. Ann. 226 (1977), 195–206.Google Scholar