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

Reapply modulo helpers and inline fast remainders

Browse Source
This commit is contained in:
Marek Lemańczyk committed 2025-09-22 19:26:07 +02:00
1 parent 5db0c4fa95
commit ca866ffc5b
43 files changed
+982 -134
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

PerfectNumbers.Core/PrimeTester.cs
+4 -4
View File
@@ -53,13 +53,13 @@ public sealed class PrimeTester(bool useInternal = false)
{
result = false;
}
else if (n > 5UL && (n % 5UL) == 0UL)
else if (n > 5UL && n % 5UL == 0UL)
{
result = false;
}
else
{
if (n.Mod10() == 1UL && SharesFactorWithMaxExponent(n))
if (n % 10UL == 1UL && SharesFactorWithMaxExponent(n))
{
result = false;
}
@@ -260,13 +260,13 @@ public sealed class PrimeTester(bool useInternal = false)
return;
}
if ((n & 1UL) == 0UL || (n > 5UL && (n % 5UL) == 0UL))
if ((n & 1UL) == 0UL || (n > 5UL && n % 5UL == 0UL))
{
results[index] = 0;
return;
}
if (n.Mod10() == 1UL)
if (n % 10UL == 1UL)
{
// Early reject special GCD heuristic with floor(log2 n)
ulong m = 63UL - (ulong)ILGPU.Algorithms.XMath.LeadingZeroCount(n);