kevin/euclidean-perfection
Archived
1
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
This repository has been archived on 2022-11-30. You can view files and clone it, but cannot push or open issues or pull requests.
4 Commits 1 Branch 0 Tags 83 KiB
Python 100%
master
Go to file
kcotugno 4e06d2bed7 Improved prime checker + fixed typos
2014-05-31 14:33:30 -07:00
.gitignore initial commit 2014-05-30 10:26:38 -07:00
euclideanp.py Improved prime checker + fixed typos 2014-05-31 14:33:30 -07:00
LICENSE initial commit 2014-05-30 10:26:38 -07:00
README README Updated 2014-05-30 18:44:41 -07:00

README 

Find perfect numbers as defined in book VII of Euclid's Elements. The method is 
from what he proved in prop 36 of book IX.

More info: http://en.wikipedia.org/wiki/Perfect_number

Requires Python 3.X