Primitive weird numbers having more than three distinct prime factors

zbMath1410.11005arXiv1803.00324MaRDI QIDQ4977333

Giuseppe Melfi, Maximilian F. Hasler, Maurizio Parton, Gianluca Amato

Publication date: 16 August 2017

Full work available at URL: https://arxiv.org/abs/1803.00324

zbMATH Keywords

Erdős problemsabundant numberssemiperfect numbersalmost perfect numberssum-of-divisor function

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25)

Related Items (2)

Primitive abundant and weird numbers with many prime factors ⋮ On a sequence of densities generated by the greedy algorithm

This page was built for publication: Primitive weird numbers having more than three distinct prime factors