Primitive weird numbers having more than three distinct prime factors

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

Primitive weird numbers having more than three distinct prime factors

Gianluca Amato Maximilian F. Hasler ¹ Giuseppe Melfi Maurizio Parton

1 CEREGMIA - Centre de Recherche en Economie, Gestion, Modélisation et Informatique Appliquée

Abstract : Primitive weird numbers having more than three distinct prime factors 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 p1 ... pk for a suitable deficient positive integer m and primes p1, ..., pk and generalize a recent technique developed for generating primitive weird numbers of the form 2^n p1 p2. The same techniques can be used to search for odd weird numbers, whose existence is still an open question.

Keywords : Abundant numbers semiperfect numbers almost perfect numbers sum-of-divisor function Erdös problems weird numbers

Document type :

Journal articles

Domain :

Mathematics [math] / Number Theory [math.NT]

Complete list of metadatas

Cited literature [11 references] Display Hide Download

https://hal.univ-antilles.fr/hal-01684543
Contributor : Maximilian Hasler <>
Submitted on : Monday, January 15, 2018 - 3:39:40 PM
Last modification on : Friday, November 30, 2018 - 4:20:04 PM
Long-term archiving on : Monday, May 7, 2018 - 12:53:03 PM

Primitive weird numbers having more than three distinct prime factors

File

Identifiers

Collections

Citation

Export

Metrics

137

96

Contact

Primitive weird numbers having more than three distinct prime factors

File

Identifiers

Collections

Citation

Export

Share

Metrics

137

96

Contact