Primitive abundant and weird numbers with many prime factors

We give an algorithm to enumerate all primitive abundant numbers (PAN) with a fixed Ω, the number of prime factors counted with their multiplicity. We explicitly find all PAN up to Ω=6, count all PAN and square-free PAN up to Ω=7 and count all odd PAN and odd square-free PAN up to Ω=8. We find primi...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of number theory 2019-08, Vol.201, p.436-459
Hauptverfasser:	Amato, Gianluca, Hasler, Maximilian F., Melfi, Giuseppe, Parton, Maurizio
Format:	Artikel
Sprache:	eng
Schlagworte:	Mathematics Number Theory Odd perfect numbers Primitive abundant numbers Primitive weird numbers
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!