This website requires JavaScript.
Explore
Help
Sign In
mlemanczyk
/
even-perfect-numbers-scanner
Watch
1
Star
0
Fork
0
Code
Issues
Pull Requests
Actions
Packages
Projects
Releases
Wiki
Activity
1,064
Commits
19
Branches
0
Tags
dfd3f71f5d3e5fce10119ebb8ef6d7675d32d7d2
Commit Graph
3 Commits
Include renames
Author
SHA1
Message
Date
mlemanczyk
6b80e31e6c
Pow2MontgomeryModWindowedConvertToStandardCpu usages replaced with a comparison to MontgomeryOne avoiding unnecessary conversions. Results updated.
2026-01-03 01:37:40 +01:00
mlemanczyk
87a66e4eca
DivisorSet scans added as EnumDependentTemplate to MersenneNumberDivisorByDivisorCpuTesterWithTemplate. New Pow2Groups scan implemented based on statistics for high divisors. MersenneNumberDivisorByDivisorPrimeScan sessions integrated into MersenneNumberDivisorByDivisorPrimeScanSessionWithTemplate. Various micro optimizations to eliminate variable, unnecessary struct creations and continue scans in higher divisor ranges, when lower ranges are exhausted. --bydivisor-k-increment command-line argument added.
2025-12-28 00:45:08 +01:00
mlemanczyk
2bf9ff233c
PrimeOrderCalculator converted to a template.
2025-12-21 18:02:59 +01:00