Anonymous user
Perfect numbers: Difference between revisions
m
Take "See also" off the TOC and rm the explicit TOC
(→{{header|Perl}}: fix uninitialized value warning when doing functional style perf(1) with "use warnings") |
m (Take "See also" off the TOC and rm the explicit TOC) |
||
Line 5:
Note: The faster [[Lucas-Lehmer test]] is used to find primes of the form 2<sup>''n''</sup>-1, all ''known'' perfect numbers can be derived from these primes using the formula (2<sup>''n''</sup> - 1) × 2<sup>''n'' - 1</sup>. It is not known if there are any odd perfect numbers.
* [[Rational Arithmetic]]
=={{header|Ada}}==
| |||