Skip to content

SChernykh/Amicable

boinc-version
Switch branches/tags

Name already in use

A tag already exists with the provided branch name. Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Are you sure you want to create this branch?
6 branches 1 tag
Code
This branch is 43 commits ahead, 9 commits behind master.

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
Amicable
 
 
primesieve
 
 
Amicable.sln
 
 
README.md
 
 
makefile
 
 

README.md

Amicable

This source code implements the leading-edge algorithm for running an exhaustive search for amicable pairs.

This is a special version for BOINC project https://sech.me/boinc/Amicable/

Performance when compiled with Visual Studio 2015 update 3 (profile-guided optimizations on) and running on Core i7-4770K:

  • All amicable pairs < 10^9: 0.118 seconds (586 pairs)
  • All amicable pairs < 10^11: 11.858 seconds (3340 pairs)
  • All amicable pairs < 10^13: 21 minutes 23.53 seconds (17519 pairs)

About

A very, very fast algorithm for finding all amicable pairs in the specified range

sech.me/ap/articles.html#a1

Topics

amicable-pairs amicable-numbers amicable boinc boinc-project

Resources

Readme

Stars

12 stars

Watchers

2 watching

Forks

7 forks
Report repository

Releases 1

1.0 Latest
Nov 11, 2015

Packages

No packages published

Languages