论文信息 - On Dickson's Theorem Concerning Odd Perfect Numbers

On Dickson's Theorem Concerning Odd Perfect Numbers

Abstract A 1913 theorem of Dickson asserts that for each fixed natural number k, there are only finitely many odd perfect numbers N with at most k distinct prime factors. We show that the number of such N is bounded by 4k2.

Paul Pollack

[1] D. N. Lehmer,et al. Multiply Perfect Numbers , 1900 .

[2] L. Dickson. Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .

[3] E. Wirsing,et al. Bemerkung zu der Arbeit über vollkommene Zahlen in Math. Ann. Bd. 133, S. 431–438 (1957) , 1959 .

[4] Pace P. Nielsen. Odd perfect numbers have at least nine distinct prime factors , 2006, Math. Comput..

[5] D. R. Heath-Brown. Odd perfect numbers , 1994, Mathematical Proceedings of the Cambridge Philosophical Society.

[6] Steven Gimbel,et al. Sylvester: Ushering in the Modern Era of Research on Odd Perfect Numbers , 2003 .

[7] Pace P. Nielsen. AN UPPER BOUND FOR ODD PERFECT NUMBERS , 2003 .

[8] Carl Pomerance. Multiply perfect numbers, mersenne primes, and effective computability , 1977 .

[9] R. Cook. Bounds for odd perfect numbers , 1999 .