Amicable Numbers: Difference between revisions
Jump to navigation
Jump to search
first light |
why |
||
| Line 2: | Line 2: | ||
== Why Amicable Numbers? == | == Why Amicable Numbers? == | ||
Collecting data on all amicable numbers up to a very large limit will facilitate theoretical research in several fields: [https://math.dartmouth.edu/~carlp/Amicable1.pdf 1], [https://math.dartmouth.edu/~carlp/Amicable2.pdf 2], [https://math.dartmouth.edu/theses/undergrad/2014/Nguyen-thesis.pdf 3] to name a few examples. | |||
Data from this project will also help to improve understanding of the properties of '''''[[wikipedia:Divisor_function|Divisor function]]'''''. | |||
== Goal == | == Goal == | ||
Revision as of 14:23, 10 March 2024
Amicable Numbers is an independent research project that uses volunteer computing to find new amicable pairs.
Why Amicable Numbers?
Collecting data on all amicable numbers up to a very large limit will facilitate theoretical research in several fields: 1, 2, 3 to name a few examples.
Data from this project will also help to improve understanding of the properties of Divisor function.
Goal
The current goal of the project is to find all amicable pairs with smallest member < 1021.
Methods
- always including "why BOINC"?
Demonstration, with rods, of the amicability of the pair of numbers (220,284) - impactful final statement
Project team / Sponsors
Sergei Chernykh
Scientific results
New data from this project is published regularly on the Amicable pairs list page.