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

TODO added

Browse Source
This commit is contained in:
mlemanczyk committed 2025-10-13 21:16:03 +02:00
1 parent e9373dd8c9
commit 7c71d5165e
1 file changed
+1
Download Patch File Download Diff File Expand all files Collapse all files
PerfectNumbers.Core/PrimeOrderCalculator.cs
+1
View File
@@ -135,6 +135,7 @@ internal static partial class PrimeOrderCalculator
private static ulong CalculateInternal(ulong prime, ulong? previousOrder, in MontgomeryDivisorData divisorData, in PrimeOrderSearchConfig config) private static ulong CalculateInternal(ulong prime, ulong? previousOrder, in MontgomeryDivisorData divisorData, in PrimeOrderSearchConfig config)
{ {
// TODO: Is this condition ever met on EvenPerfectBitScanner's execution path? If not, we can add a clarification comment and comment out the entire block. We want to support p candidates at least greater or equal to 31.
if (prime <= 3UL) if (prime <= 3UL)
{ {
return prime == 3UL ? 2UL : 1UL; return prime == 3UL ? 2UL : 1UL;