Perfect numbers: Difference between revisions
Content deleted Content added
m →[[Perfect Numbers#ALGOL 68]]: c.f. Lucas-Lehmer_test for even perfect numbers of the form: (2ⁿ-1) × 2ⁿ/2 |
m →[[Perfect Numbers#ALGOL 68]]: (2ⁿ-1) × 2ⁿ ÷ 2 |
||
Line 3: | Line 3: | ||
A number is perfect if the sum of its factors is equal to twice the number. An equivalent condition is that <tt>n</tt> is perfect if the sum of <tt>n</tt>'s factors that are less than <tt>n</tt> is equal to <tt>n</tt>. |
A number is perfect if the sum of its factors is equal to twice the number. An equivalent condition is that <tt>n</tt> is perfect if the sum of <tt>n</tt>'s factors that are less than <tt>n</tt> is equal to <tt>n</tt>. |
||
Note: The faster [[Lucas-Lehmer_test]] is used to find primes of the form 2ⁿ-1, all ''known'' perfect numbers can derived from these primes using the formular <tt>(2ⁿ-1) × 2ⁿ |
Note: The faster [[Lucas-Lehmer_test]] is used to find primes of the form 2ⁿ-1, all ''known'' perfect numbers can derived from these primes using the formular <tt>(2ⁿ-1) × 2ⁿ ÷ 2</tt>. It is not known if there are any odd perfect numbers. |
||
=={{header|Ada}}== |
=={{header|Ada}}== |