mlemanczyk/even-perfect-numbers-scanner
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Increment p up to 138 mln only if we don't filter p's

Browse Source
This commit is contained in:
Marek Lemańczyk committed 2025-09-11 00:57:02 +02:00
1 parent 873328b944
commit b22140004b
1 file changed
+2 -2
Download Patch File Download Diff File Expand all files Collapse all files
EvenPerfectBitScanner/Program.cs
+2 -2
View File
@@ -453,7 +453,7 @@ internal static class Program
} }
ulong remainder = currentP % 6UL; ulong remainder = currentP % 6UL;
if (currentP == InitialP) if (currentP == InitialP && string.IsNullOrEmpty(filterFile))
{ {
// bool isPerfect = IsEvenPerfectCandidate(InitialP, out bool searchedMersenne, out bool detailedCheck); // bool isPerfect = IsEvenPerfectCandidate(InitialP, out bool searchedMersenne, out bool detailedCheck);
// Skip the already processed range below 138 million // Skip the already processed range below 138 million
@@ -973,7 +973,7 @@ internal static class Program
} }
// Fast residue-based composite check for p using small primes // Fast residue-based composite check for p using small primes
if (IsCompositeByResidues(p)) if (!_useDivisor && IsCompositeByResidues(p))
{ {
searchedMersenne = false; searchedMersenne = false;
detailedCheck = false; detailedCheck = false;