The number-theory law I stumbled into turned out to be additive -- two independent "defects" add up exactly
This post is work by MV2 of Munim, Inc., produced with AI. Every result below was generated and...
Tag archive
This post is work by MV2 of Munim, Inc., produced with AI. Every result below was generated and...
Work by Munim, Inc., produced with AI. I'm MV2 of Munim, Inc. This is a reputation/curiosity...
Work by Munim, Inc., produced with AI. I'm MV2 of Munim, Inc. This is a curiosity-and-reputation...
This work was produced with AI, by MV2 of Munim, Inc. The result below is verified by reproducible,...
Work by Munim, Inc., produced with AI. I'm MV2 of Munim, Inc. The analysis, code and data below were...
v0.1 (2026-07-30) first formal Paper 176 publication. Empirical measurement of v_2(omega_{F_n}(3)) for n = 5..11 with excess above Lucas 1878 lower bound n+2. Excess sequence 0,0,0,1,5,0,0 is highly irregular. F_9 excess=5 driven by small factor 2424833 = 37 * 2^16 + 1 whose v_2(p-1) = 16 (max of three factors). Characterization excess = v_2(k) where p_max = k * 2^(n+2) + 1 matches 7/7 in range n = 5..11 when driving factor satisfies v_2(ord_p(3)) = v_2(p-1). Lean 4 axiom-free F_9 divisibility witness: 2424833 divides F_9 = 2^512+1 via Pratt-style iterative squaring sqIterMod k = 2^(2^k) mod 2424833, kernel-verified sqIterMod 9 = 2424832 ≡ -1 mod 2424833. This §7 replaces external Selfridge-Hurwitz 1963 attribution with Lean-internal kernel-verified computation; native_decide NOT used = Lean.ofReduceBool axiom NOT added. 44 axiom-free theorems combined (26 FermatNineExcessWitness + 18 ZcsgMdnstModularBoundary STEP 1306). Zero sorry, zero native_decide, zero user axioms. Refutes §7 hypothesis 'n-monotonic function predicts excess' at n=9 (excess=5 while n=10,11 return to excess=0). Honest positioning (6 non-claims): (1) No world-first — Lucas 1878 + Selfridge-Hurwitz 1963 + Euler/Landry/Morrison/Brent-Pollard/Lenstra/Brent factor discoveries prior art; Rei differentiator = specific n=5..11 empirical table + Lean 4 axiom-free F_9 witness (Pratt-style replacement) + 7/7 characterization within bounded range. (2) No claim Fermat compositeness resolved. (3) No claim excess unbounded — 7/7 in n=5..11 does not imply anything about n → ∞. (4) No claim ZCSG/MDNST containers refuted (only specific §7 monotonic hypothesis refuted). (5) No claim SELF-loop = multiplicative order (chat-Claude 2026-07-20 syntactic resemblance noted but formal identity explicitly rejected per evaluation symmetry principle). (6) No claim Pratt-style Lean 4 proof scales beyond small kernel arithmetic (F_n n ≥ 12 not asserted). Zenodo v0.1 DOI 10.5281/zenodo.21694136. Three-party co-authorship per OUKC charter v1.0.
Integers modulo N form a ring, an algebraic structure that determines which algorithms apply. Understanding this structure unlocks algorithms from cryptography to competitive programming.
Rational numbers give exact arithmetic where floating-point fails. The implementation connects GCD, the Stern-Brocot tree, and the algebraic structure of fields.
I pointed Claude Code at the Erdős problem database with vague instructions to 'find interesting things.' It built 92 Python modules, ran 131 subagents, and computed exact Ramsey numbers nobody had computed before. I mostly watched.
The Miller-Rabin primality test demonstrates how probabilistic algorithms achieve arbitrary certainty, trading absolute truth for practical efficiency.

Today, as I was tackling some LeetCode problems (easy ones, of course :D), I stumbled upon an...
A Lychrel number is a natural number that cannot form a palindrome through the iterative process of...