Amicable Numbers is an independent research project that uses Boinc to find new amicable pairs. Current goal of the project is to find all amicable pairs with smallest member < 264, all new findings are published regularly on the Amicable pairs list page.
Though mathematics is not an experimental science, mathematicians often look for examples to test conjectures (which they then hope to prove). As the number of examples increases, so does (in a sense) their understanding of the distribution.
The goal is to collect all amicable numbers up to a very large limit, this will also help to improve understanding of the properties of Divisor function.
While e.g. SRBase is a pure CPU project (see Pt. 1) Amicable Numbers works best with GPU's. I was looking for a project which runs nicely on my NVidia 1060 without freezing my machine while e.g. surfing or watching a film and Amicable Numbers works great without disturbing me.
You can also crunch Amicable Numbers with your CPU (or with both, CPU and GPU) but there are way better projects for your CPU then Amicable Numbers.
My Project Rank Total Credit: 235 out of 1183
My Project Rank Recent Average Credit: 101 out of 1183
Amicable pairs discovered: 81
Until today i've contributed 8,470,448 Cobblestones of computation (7.32 quintillion floating-point operations) to Amicable Numbers.
I'm earning some money crunching for Amicable Numbers with Team Gridcoin!
Team Rank by Total Credit: 79 out of 382
Team Rank by Recent Average Credit: 54 out of 382
