This website requires JavaScript.
Explore
Help
Register
Sign In
MoPa
/
hcn
Watch
2
Star
0
Fork
0
You've already forked hcn
Code
Issues
Pull Requests
Packages
Projects
Releases
Wiki
Activity
4
Commits
2
Branches
1
Tag
Commit Graph
4 Commits
This Branch
This Branch
All Branches
Author
SHA1
Message
Date
ddidderr
24cf088011
[feature] single thread code to calculate hcns using prime factorization
2023-12-07 18:38:36 +01:00
ddidderr
2f6449a25a
[fix] prime sieve was missing the number 2
2023-12-07 18:37:42 +01:00
ddidderr
4c56ab2779
[feature] get primes fast with sieve of Eratosthenes
2023-12-02 09:20:20 +01:00
ddidderr
3434c9d4f6
hcn: highly composite number
...
A tool to find highly composite numbers fast.
2023-12-02 09:19:34 +01:00