Primitive abundant and weird numbers with many prime factors
From MaRDI portal
Publication:2631707
Abstract: We give an algorithm to enumerate all primitive abundant numbers (briefly, PANs) with a fixed (the number of prime factors counted with their multiplicity), and explicitly find all PANs up to , count all PANs and square-free PANs up to and count all odd PANs and odd square-free PANs up to . 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 and prove that there are none with . Regarding PWNs with a cubic (or higher) odd prime factor, we prove that there are none with , and we did not find any with larger . 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- Lucas Pseudoprimes
- Odd perfect numbers have at least nine distinct prime factors
- On Weird and Pseudoperfect Numbers
- On the conditional infiniteness of primitive weird numbers
- On the interval containing at least one prime number
- Primitive weird numbers having more than three distinct prime factors
- Sums of divisors and Egyptian fractions
- The Pseudoprimes to 25 ⋅10 9
- Unsolved problems in number theory
Cited in
(2)
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)