A lower bound for the set of odd perfect numbers-Reference-Cited by-同舟云学术

A lower bound for the set of odd perfect numbers

Published:1973 Issue:124 Volume:27 Page:951-953
ISSN:0025-5718
Container-title:Mathematics of Computation
language:en
Short-container-title:Math. Comp.

Author:

Hagis Peter

Abstract

It is proved here that if n is odd and perfect, then n > 10 50 n > {10^{50}} .

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,Computational Mathematics,Algebra and Number Theory

Link

http://www.ams.org/mcom/1973-27-124/S0025-5718-1973-0325507-9/S0025-5718-1973-0325507-9.pdf

Reference11 articles.

1. P. Hagis, Jr., "If n is odd and perfect then 𝑛>10⁴⁵. A case study proof with a supplement in which the lower bound is improved to 10⁵⁰." Copy deposited in UMT file.

2. On the largest prime divisor of an odd perfect number;Hagis, Peter, Jr.;Math. Comp.,1973

3. Folgerungen aus dem Vorkommen einer Gauss’schen Primzahl in der Primfaktorenzerlegung einer ungeraden vollkommenen Zahl;Kanold, Hans-Joachim;J. Reine Angew. Math.,1944

4. Über mehrfach vollkommene Zahlen. II;Kanold, Hans-Joachim;J. Reine Angew. Math.,1957

5. On divisors of odd perfect numbers;Muskat, Joseph B.;Math. Comp.,1966

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computers As a Novel Mathematical Reality: III. Mersenne Numbers and Sums of Divisors;Doklady Mathematics;2023-06

2. Wie kann man Primzahlen erkennen?;Die Welt der Primzahlen;2011

3. Perfect numbers: Old and new issues; perspectives;Handbook of Number Theory II;2004

4. Zahlentheorie;Alte und neue ungelöste Probleme in der Zahlentheorie und Geometrie der Ebene;1997

5. P;Encyclopaedia of Mathematics;1995