Upper bounds on the second largest prime factor of an odd perfect number

Abstract: Acquaah and Konyagin showed that if

N

is an odd perfect number where

N = p_{1}^{a_{1}} p_{2}^{a_{2}} c d o t s p_{k}^{a_{k}}

where

p_{1} < p_{2} c d o t s < p_{k}

then one must have

p_{k} < 3^{1 / 3} N^{1 / 3}

. Using methods similar to theirs, we show that

p_{k - 1} < (2 N)^{1 / 5}

and that

p_{k - 1} p_{k} < 6^{1 / 4} N^{1 / 2} .

We also show that if

p_{k}

and

p_{k - 1}

are close to each other than these bounds can be further strengthened.

Recommendations

Cites Work

Cited In (3)

This page was built for publication: Upper bounds on the second largest prime factor of an odd perfect number