Randomized trial evaluates prime richness in n^(2^k)+1 sequences, suggesting new insights into prime distribution.
Part XXXII read prime richness as the product of per-prime "dodges" — primes forbidden to divide a sequence enhance it. We push that idea into higher degree along the Fermat-type family n^(2^k)+1: n^2+1, n^4+1, n^8+1. The arithmetic is governed by a single cyclotomic fact: x^(2^k) ≡ −1 (mod q) is solvable exactly when q ≡ 1 (mod 2^(k+1)), with 2^k roots. So n^(2^k)+1 can be divided only by q=2 and primes q ≡ 1 (mod 2^(k+1)), a vanishing fraction 2^(−k) of all primes, while at those primes it is hit hard (ω = 2^k). At n=2 this family is the Fermat numbers F_k = 2^(2^k)+1, whose early terms led Fermat to guess they were all prime until F_5 fell to 641: the same exponent that widens the dodge sets the depth of any hit. Two findings, measured by direct (Miller–Rabin / BPSW) primality testing to n ≤ 10^6 (n^4+1 up to 10^24). (i) The mod-6 wing structure is degree-invariant: every n^(2^k)+1 splits its primes right:left = 1:2 exactly as n^2+1 does, because n^(2^k) ≡ n^2 (mod 6) for all k ≥ 1; the exponent is invisible to the coarse lattice. (ii) The Bateman–Horn richness C = Π_q g(q) is non-monotonic in k: as the degree doubles the dodge widens (more enhancing primes) but the hits deepen, and the two effects balance to a peak at n^4+1. We measure C = 1.376, 2.676, 2.075 for k = 1, 2, 3 — rising then falling — with the local product reproducing each to ≲1%, including a degree-eight Bateman–Horn check rarely attempted (where values reach 10^40 and direct testing is the only route). None of this is new as theory — the solvability of x^(2^k) ≡ −1 and its root count are classical cyclotomic facts, C and the Bateman–Horn asymptotic are standard, and the n^2+1 constant is Landau–Shanks. What this paper adds is the 6N reading of the ladder, the degree-invariance of the wings, and a direct high-precision measurement of the richness, including the non-monotonic peak. The infinitude of primes n^4+1 is, like Landau's problem, open; we make no claim about it. As throughout this series, this is a measurement, not a theorem; the Hardy–Littlewood heuristic is taken as input. Part XXXIII of "Arithmetic Geodynamics on the 6N Skeleton." Code and measured data: https://github.com/Ruqing1963/6N-dodge-ladder
No takes yet. Share an insight, caveat, or question.
Ruqing Chen (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: