From 6dc26336c6d1bf22f786b129ecaa6abdf5dcd012 Mon Sep 17 00:00:00 2001
From: mlemanczyk <marek@lemanczyk.eu>
Date: Wed, 8 Oct 2025 19:56:53 +0200
Subject: [PATCH] Remainder check adjusted to PrimesGenerator.

---
 .../Cpu/MersenneNumberDivisorByDivisorCpuTester.cs            | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/PerfectNumbers.Core/Cpu/MersenneNumberDivisorByDivisorCpuTester.cs b/PerfectNumbers.Core/Cpu/MersenneNumberDivisorByDivisorCpuTester.cs
index 2c09f16..e3a9a07 100644
--- a/PerfectNumbers.Core/Cpu/MersenneNumberDivisorByDivisorCpuTester.cs
+++ b/PerfectNumbers.Core/Cpu/MersenneNumberDivisorByDivisorCpuTester.cs
@@ -212,12 +212,12 @@ public sealed class MersenneNumberDivisorByDivisorCpuTester : IMersenneNumberDiv
 
             bool admissible = lastIsSeven
                 ? (remainder10 == 3 || remainder10 == 7 || remainder10 == 9)
-                : (remainder10 == 1 || remainder10 == 3 || remainder10 == 7 || remainder10 == 9);
+                : (remainder10 == 1 || remainder10 == 3 || remainder10 == 9);
 
             if (admissible && (remainder8 == 1 || remainder8 == 7) && remainder3 != 0 && remainder5 != 0)
             {
                 MontgomeryDivisorData divisorData = MontgomeryDivisorDataCache.Get(candidate);
-                ulong divisorCycle = 0UL;
+                ulong divisorCycle;
 
                 if (candidate <= PerfectNumberConstants.MaxQForDivisorCycles)
                 {