Amicable Numbers: Difference between revisions
m →Methods |
clarify terminology |
||
| Line 9: | Line 9: | ||
== [https://sech.me/ap/articles.html#a1 Methods] == | == [https://sech.me/ap/articles.html#a1 Methods] == | ||
'''<small>''Terminology''</small>''' | '''<small>''<code>Terminology</code>''</small>''' | ||
<small>''N - the limit for the search. The algorithm must find all amicable pairs with smaller member m ≤ N''</small> | <small>''<code>N - the limit for the search. The algorithm must find all amicable pairs with smaller member m ≤ N</code>''</small> | ||
<small>''m - smaller number in a pair''</small> | <small>''<code>m - smaller number in a pair</code>''</small> | ||
<small>''n - larger number in a pair, or an arbitrary natural number when used in enumerations (i.e. p<sub>1</sub>, ..., p<sub>n</sub>)''</small> | <small>''<code>n - larger number in a pair, or an arbitrary natural number when used in enumerations (i.e. p<sub>1</sub>, ..., p<sub>n</sub>)</code>''</small> | ||
<small>''σ(m) - sum of all divisors of m, including 1 and m.''</small> | <small>''<code>σ(m) - sum of all divisors of m, including 1 and m.</code>''</small> | ||
The following basic algorithm can be derived from the very definition of amicable pairs: | The following basic algorithm can be derived from the very definition of amicable pairs: | ||