Improvements to recognize cases when we only find trivial divisors for p. Not fully fixed, yet.

PerfectNumbers.Core/PerfectNumberConstants.cs

@@ -24,6 +24,8 @@ public static class PerfectNumberConstants
 	public const int ByDivisorStateSaveInterval = 200_000;
 	public const string ByDivisorStateDirectory = "Checks";
 	public const int PollardRhoMilliseconds = 100;
+	public const int ByDivisorMersenneTailCount = 8;
+	public const int ByDivisorMersenneBitLimit = 4096;
     // TODO: Load these limits from the benchmark-driven configuration so CPU and GPU scans stay aligned with the optimal
     // divisor-cycle datasets we generate offline.
     // TODO: Promote these magic numbers into a runtime profile derived from EvenPerfectBitScanner.Benchmarks so we can retune