Talk:Factor-perfect numbers: Difference between revisions
→Ok, but what is F?: new section
mNo edit summary |
(→Ok, but what is F?: new section) |
||
Line 53:
I updated the examples to reflect Erdos' algorithm on the first page of the referenced paper. --[[User:Wherrera|Wherrera]] ([[User talk:Wherrera|talk]]) 00:57, 8 October 2022 (UTC)
== Ok, but what is F? ==
Currently, the task page says:
<ul>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. </ul>
However, there's no accompanying definition for F, reviewing the first page of the [https://www.jstor.org/stable/1968777?origin=crossref linked paper] where this expression occurs yields an incomplete definition for F (what is <code>cn</code>? What is <code>o</code>?) --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 12:31, 9 October 2022 (UTC)
| |||