Improved techniques for lower bounds for odd perfect numbers
Abstract: "If N is an odd perfect number, and q[superscript k] [symbol] N, q prime, k even, then it is almost immediate that N > q[superscript 2k]. We prove here that, subject to certain conditions verifiable in polynomial time, in fact N > q[superscript 5k/2]. Using this and related resu...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1989
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Numerieke Wiskunde: Report NM
1989,21 |
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | Abstract: "If N is an odd perfect number, and q[superscript k] [symbol] N, q prime, k even, then it is almost immediate that N > q[superscript 2k]. We prove here that, subject to certain conditions verifiable in polynomial time, in fact N > q[superscript 5k/2]. Using this and related results, we are able to extend the computations in an earlier paper to show that N > 10[superscript 300]." |
|---|---|
| Beschreibung: | 13 S. |