Primitive abundant and weird numbers with many prime factors

DOI10.1016/J.JNT.2019.02.027zbMATH Open1437.11167arXiv1802.07178OpenAlexW2788694382WikidataQ114157259 ScholiaQ114157259MaRDI QIDQ2631707FDOQ2631707

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

Publication date: 16 May 2019

Published in: Journal of Number Theory (Search for Journal in Brave)

Abstract: 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 odd square-free PANs up to $Omega=8$. We find primitive weird numbers (briefly, PWNs) with up to 16 prime factors, improving the previous results of [Amato-Hasler-Melfi-Parton] where PWNs with up to 6 prime factors have been given. The largest PWN we find has 14712 digits: as far as we know, this is the largest example existing, the previous one being 5328 digits long [Melfi]. We find hundreds of PWNs with exactly one square odd prime factor: as far as we know, only five were known before. We find all PWNs with at least one odd prime factor with multiplicity greater than one and $Omega=7$ and prove that there are none with $Omega<7$. Regarding PWNs with a cubic (or higher) odd prime factor, we prove that there are none with $Omegale7$, and we did not find any with larger $Omega$. Finally, we find several PWNs with 2 square odd prime factors, and one with 3 square odd prime factors. These are the first such examples.

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

Recommendations

• Primitive weird numbers having more than three distinct prime factors
• On the conditional infiniteness of primitive weird numbers
• On Primitive Abundant Numbers
• On the distribution of primitive abundant numbers
• On the Density of the Abundant Numbers

zbMATH Keywords

odd perfect numbersprimitive abundant numbersprimitive weird numbers

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Distribution of integers with specified multiplicative constraints (11N25) Calculation of integer sequences (11Y55)

Cites Work

• Title not available (Why is that?)
• Unsolved problems in number theory
• On the interval containing at least one prime number
• The Pseudoprimes to 25 ⋅10 9
• Lucas Pseudoprimes
• On Weird and Pseudoperfect Numbers
• On the conditional infiniteness of primitive weird numbers
• Sums of divisors and Egyptian fractions
• Odd perfect numbers have at least nine distinct prime factors
• Primitive weird numbers having more than three distinct prime factors

Cited In (2)

• On the conditional infiniteness of primitive weird numbers
• Primitive weird numbers having more than three distinct prime factors

Uses Software

• OEIS

This page was built for publication: Primitive abundant and weird numbers with many prime factors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631707)