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

zbMath1487.11007arXiv1810.13063MaRDI QIDQ4958959

Joshua Zelinsky

Publication date: 15 September 2021

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

zbMATH Keywords

odd perfect numbertriple threat

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Primes represented by polynomials; other multiplicative structures of polynomial values (11N32) Factorization; primality (11A51)

Related Items (2)

Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tau numbers, natural density, and Hardy and Wright's theorem 437
• On the factorization of iterated polynomials
• Über ungerade vollkommene Zahlen
• Sieve methods for odd perfect numbers
• Odd perfect numbers are greater than $10^{1500}$
• On the number of prime factors of an odd perfect number
• Remarks on the number of factors of an odd perfect number
• Odd perfect numbers have a prime factor exceeding $10^8$
• Odd perfect numbers have at least nine distinct prime factors
• New techniques for bounds on the total number of prime factors of an odd perfect number
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
• The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
• Odd perfect numbers, Diophantine equations, and upper bounds
• An improvement of an inequality of Ochem and Rao concerning odd perfect numbers
• Über abundante Zahlen

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