Home

UNSOLVED PROBLEMS

in Number Theory, Logic, and Cryptography


Up
Introduction
What's New?
FAQ
Chromatic Number
Collatz
Dorabella Cipher
Euler's Brick
Goldbach
Legendre
Odd Perfect Number
Riemann Hypothesis
RSA Challenge
Square of Squares
Twin Primes
Voynich Manuscript
Zodiac
Solutions
Math Tuition

 

Odd Perfect Number

 

A number N is perfect if the sum of its divisors, including 1 but excluding itself, add up to N.

So, for example, 28 is perfect because 1 + 2 + 4 + 7 + 14 = 28.

 

The problem is to find an odd perfect number, or prove that no such number exists. 

 

 

For further information, please see:

[1] http://mathworld.wolfram.com/OddPerfectNumber.html

[2] http://en.wikipedia.org/wiki/Odd_perfect_number

[3] http://www-groups.dcs.st-and.ac.uk/~history/HistTopics/Perfect_numbers.html

 

 

* There is currently 1 contribution to this problem on the solutions page.


Home ] Introduction ] What's New? ] FAQ ] Chromatic Number ] Collatz ] Dorabella Cipher ] Euler's Brick ] Goldbach ] Legendre ] [ Odd Perfect Number ] Riemann Hypothesis ] RSA Challenge ] Square of Squares ] Twin Primes ] Voynich Manuscript ] Zodiac ] Solutions ] Math Tuition ]


       Site developed and maintained by Tim Roberts .
       Last modified: August 01, 2007                        v 016