A Partial Proof of a Conjecture of Dris

2016/02/04 by Brown, Patrick
#11-04 #11A25 #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1602.01591

Abstract

Euler showed that if an odd perfect number N exists, it must consist of two parts N=q^k n², with q prime, q ≡ k ≡ 1 \pmod4, and gcd(q,n)=1. Dris conjectured that q^k < n. We first show that q

Related

• On Dris Conjecture about Odd Perfect Numbers
• On the Descartes-Frenicle-Sorli and Dris Conjectures Regarding Odd Perfect Numbers
• More on the Nonexistence of Odd Perfect Numbers of a Certain Form
• A short proof for the Descartes-Frenicle-Sorli conjecture on odd perfect\n numbers
• A Sufficient Condition for Disproving Descartes's Conjecture on Odd Perfect Numbers