From 7c71d5165ef16eedc29c8771d1ed6899f8ef801d Mon Sep 17 00:00:00 2001
From: mlemanczyk <marek@lemanczyk.eu>
Date: Mon, 13 Oct 2025 21:16:03 +0200
Subject: [PATCH] TODO added

---
 PerfectNumbers.Core/PrimeOrderCalculator.cs | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/PerfectNumbers.Core/PrimeOrderCalculator.cs b/PerfectNumbers.Core/PrimeOrderCalculator.cs
index 24c0511..1deac16 100644
--- a/PerfectNumbers.Core/PrimeOrderCalculator.cs
+++ b/PerfectNumbers.Core/PrimeOrderCalculator.cs
@@ -134,7 +134,8 @@ internal static partial class PrimeOrderCalculator
     }
 
     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)
         {
             return prime == 3UL ? 2UL : 1UL;