Logo
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,040 Commits 19 Branches 0 Tags
12c477b1a28b41a71f81ce8fea01ae6b0dfc5b36
Commit Graph
8 Commits
Author SHA1 Message Date
mlemanczyk 12c477b1a2 BitContradiction improvements to be aware of the highest "a" bit being 1 and of the minimum and maximum "a" bit length. 2026-01-13 06:56:08 +01:00
mlemanczyk d0dbb8f92a BitContradiction solvers improvements to increase early exclusions. 2026-01-13 04:20:34 +01:00
mlemanczyk bf93bcff1a BitContradictionSolverWithQMultiplier improvements. BitContradictionSolverWithAMultiplier added. 2026-01-12 20:50:54 +01:00
mlemanczyk dc7a499f82 BitContradiction optimizations 2026-01-12 02:45:46 +01:00
mlemanczyk 2b803abcac BitContradiction mode modified to check for contradictions from both sides. 2026-01-12 01:49:10 +01:00
mlemanczyk 45e3455ff3 DivisorSet.BitContradiction mode added to --mersenne=bydivisor. 2026-01-04 17:59:02 +01:00
mlemanczyk 6a924f4041 DivisorSet.Percentile, Additive and TopDown modes implemented. State files ported to LMDB => FASTER to avoid millions of files in folders. 2026-01-04 12:17:27 +01:00
mlemanczyk a6d408f2aa Predictive scanning implemented for bydivisor method. 2026-01-03 20:01:22 +01:00
Powered by Gitea Version: 28.2.0 Page: 347ms Template: 64ms
Auto
English
Bahasa Indonesia Deutsch English Español Français Gaeilge Italiano Latviešu Magyar nyelv Nederlands Polski Português de Portugal Português do Brasil Suomi Svenska Türkçe Čeština Ελληνικά Български Русский Українська فارسی മലയാളം 日本語 简体中文 繁體中文(台灣) 繁體中文(香港) 한국어
Licenses API