Primitive weird numbers having more than three distinct prime factors

zbMATH Open1410.11005arXiv1803.00324MaRDI QIDQ4977333FDOQ4977333

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

Publication date: 16 August 2017

Abstract: In this paper we study some structure properties of primitive weird numbers in terms of their factorization. We give sufficient conditions to ensure that a positive integer is weird. Two algorithms for generating weird numbers having a given number of distinct prime factors are presented. These algorithms yield primitive weird numbers of the form $m{p}_{1}dots{p}_k$ for a suitable deficient positive integer $m$ and primes $p_1,dots,p_k$ and generalize a recent technique developed for generating primitive weird numbers of the form $2^n{p}_1{p}_2$. The same techniques can be used to search for odd weird numbers, whose existence is still an open question.

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

zbMATH Keywords

abundant numberssemiperfect numbersalmost perfect numberssum-of-divisor functionErdős problems

Mathematics Subject Classification ID

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

Cited In (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

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