An upper bound for odd perfect numbers.

Nielsen, Pace P.

Displaying similar documents to “An upper bound for odd perfect numbers.”

On perfect numbers connected with the composition of arithmetic functions.

Sándor, József, Kovács, Lehel István (2009)

Acta Universitatis Sapientiae. Mathematica

Similarity:

Variations on Euclid's formula for perfect numbers.

Firoozbakht, Farideh, Hasler, Maximilian F. (2010)

Journal of Integer Sequences [electronic only]

Similarity:

Sylvester: ushering in the modern era of research on odd perfect numbers.

Gimbel, Steven, Jaroma, John H. (2003)

Integers

Similarity:

An analogue in certain unique factorization domains of the Euclid-Euler theorem on perfect numbers.

McDaniel, Wayne L. (1990)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Thirty-nine perfect numbers and their divisors.

Asadulla, Syed (1986)

International Journal of Mathematics and Mathematical Sciences

Similarity:

On near-perfect and deficient-perfect numbers

Min Tang, Xiao-Zhi Ren, Meng Li (2013)

Colloquium Mathematicae

Similarity:

For a positive integer n, let σ(n) denote the sum of the positive divisors of n. Let d be a proper divisor of n. We call n a near-perfect number if σ(n) = 2n + d, and a deficient-perfect number if σ(n) = 2n - d. We show that there is no odd near-perfect number with three distinct prime divisors and determine all deficient-perfect numbers with at most two distinct prime factors.