Factor-perfect numbers: Difference between revisions
Content added Content deleted
m (→{{header|Phix}}: updated timings) |
m (add another method) |
||
| Line 21: | Line 21: | ||
* Show all 48 ordered sequences for each of the two methods for n = 48, which is the first non-trivial factor-perfect number. |
* Show all 48 ordered sequences for each of the two methods for n = 48, which is the first non-trivial factor-perfect number. |
||
<br> |
|||
According to the paper listed below by P. Erdos, the number of these sequences is |
|||
: <math display="block"> F(n) = \sum_{k} F(\frac{n}{a_k}) + 1 </math> |
|||
where a is a list of the factors of n, including n, but excluding 1. |
|||
* Write a program to calculate and show the first 7 numbers of the factor-perfect numbers. |
* Write a program to calculate and show the first 7 numbers of the factor-perfect numbers. |
||