Primitive abundant and weird numbers with many prime factors

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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2018-02
Hauptverfasser:	Amato, Gianluca, Hasler, Maximilian F, Melfi, Giuseppe, Parton, Maurizio
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Binary system Correlation analysis Digits Mathematics - Number Theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!