Amicable Numbers: Difference between revisions
→Methods: why BOINC |
→Methods: move link |
||
| Line 8: | Line 8: | ||
The current goal of Amicable Numbers is to find all amicable pairs with smallest member < 1021. | The current goal of Amicable Numbers is to find all amicable pairs with smallest member < 1021. | ||
== | == Methods == | ||
BOINC is used because it was the only viable way for this independent project to get computational power at this scale. | BOINC is used because it was the only viable way for this independent project to get computational power at this scale. | ||
| Line 28: | Line 28: | ||
* If σ(n) = σ(m), then (m, n) - amicable pair | * If σ(n) = σ(m), then (m, n) - amicable pair | ||
This is very inefficient because it requires 1 and in many cases 2 full factorizations per iteration, so improvements were devised. | This is very inefficient because it requires 1 and in many cases 2 full factorizations per iteration, so improvements were devised.[https://sech.me/ap/articles.html#a1] | ||
1. Avoiding factorization of m | 1. Avoiding factorization of m | ||