On the total number of prime factors of an odd perfect number

DOI10.1090/S0025-5718-03-01522-9zbMath1058.11006OpenAlexW1974644130WikidataQ114093885 ScholiaQ114093885MaRDI QIDQ4417182

Ronald M. Sorli, Douglas E. Iannucci

Publication date: 28 July 2003

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-03-01522-9

zbMATH Keywords

odd perfect numbers

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Values of arithmetic functions; tables (11Y70)

Related Items (3)

Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors ⋮ More on the total number of prime factors of an odd perfect number ⋮ New techniques for bounds on the total number of prime factors of an odd perfect number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The non-existence of odd perfect numbers of a certain form
• Outline of a Proof that Every Odd Perfect Number has at Least Eight Prime Factors
• Odd Perfect Numbers Not Divisible by 3. II
• Sketch of a Proof that an Odd Perfect Number Relatively Prime to 3 has at Least Eleven Prime Factors
• On the Divisibility of an Odd Perfect Number by the Sixth Power of a Prime
• Sätze über Kreisverteilungspolynome und ihre Anwendungen auf einige zahlentheoretische Probleme. II.
• On the non-existence of odd perfect numbers of form 𝑝^{𝛼}𝑞₁²𝑞₂²⋯𝑞_{𝑡-1}²𝑞_{𝑡}⁴

This page was built for publication: On the total number of prime factors of an odd perfect number