A Partial Proof of a Conjecture of Dris

MaRDI QIDQ6270122zbMATH OpenFDO

Authors Patrick H. Brown

Publication date 4 February 2016

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Arithmetic functions; related numbers; inversion formulas (11A25)

Abstract: Euler showed that if an odd perfect number $N$ exists, it must consist of two parts $N=q^k{n}^2$, with $q$ prime, $qequivkequiv1pmod4$, and gcd$(q,n)=1$. Dris conjectured that $q^k<n$. We first show that $q<n$ for all odd perfect numbers. Afterwards, we show $q^k<n$ holds in many cases.

This page was built for publication: A Partial Proof of a Conjecture of Dris

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