You are on page 1of 3

On Sorlis Conjecture Regarding

Odd Perfect Numbers - Part II


Jose Arnaldo B. Dris
Graduate, Master of Science in Mathematics
De La Salle University
Manila, Philippines 1004
jabdris@yahoo.com.ph
June 3, 2012
Let N = q k n2 be an odd perfect number (hereinafter abbreviated as OPN)
given in Eulerian form (i.e. q k 1 (mod 4) and gcd(q, n) = 1). Suppose
(q)
(n)
that
=
. Then we know that:
n
q
q(q) = n(n).
Since gcd(q, n) = 1, then q | (n) and n | (q). Therefore, it follows that
(n)
(q)
and
are equal positive integers.
n
q
This is a contradiction, as:
r
(q)
5
6
(n)
(qn)
1<
<
<
<
<2
q
5
3
n
qn
which implies that:
r

 



5
(q) (n)
(qn)
(q) (n)
=
<2
1<
<
=
3
qn
q
n
n
q
Therefore, either:
(n)
(q)
<
,
n
q
which implies (q) < (n), or
(n)
(q)
<
,
q
n
which implies n < q, further implying Sorlis conjecture that k = 1.
From Part I [1], we know that n < q k = 1.
1

We also know that:


6
I(q) <
5
where I(x) =

5
< I(n),
3

(x)
is the abundancy index of x. In particular, we know that:
x
q
(q)
<
(n)
n

Suppose that (n) (q). It follows that:


n<q
and that:

(n)
(q)
<
.
q
n
However, from Part I [1], we also know that:
(q)
(n)
<
n < q.
q
n
Hence, we have proved the following lemma:
Lemma 0.1. Let N = q k n2 be an OPN given in Eulerian form. If (n) (q),
(n)
(q)
then n < q if and only if
<
.
q
n
The contrapositive of:
(n) (q) n < q
is:
q < n (q) < (n).
Therefore, if q < n, it follows that:
(n)
(q)
<
.
n
q
However, from Part I [1], we also know that:
(n)
(q)
<
(q) < (n).
n
q
Consequently, we have proved the following lemma:
Lemma 0.2. Let N = q k n2 be an OPN given in Eulerian form. If q < n, then
(q)
(n)
(q) < (n) if and only if
<
.
n
q
Note that, if (q) < (n), then the best inequality that we could get relating
q and n is:
q+1
< n.
2
This is because the upper bound I(n) < 2 for the abundancy index of the
component n is rather crude.
2

References
[1] J. A. B. Dris, On Sorlis Conjecture Regarding Odd Perfect Numbers,
Available online: http://www.scribd.com/doc/87344770/OPNPaper5.

2010 Mathematics Subject Classification: Primary 11A05; Secondary 11J25,


11J99.
Keywords: odd perfect number, Sorlis conjecture, Euler prime.