Ramanujan Challenge Problem 2.8 Solution & Proof
allaun
aac17e6e34
Renames THE_ENCODER_APPROACH.md -> HOW_THE_SOLUTION_WAS_FOUND.md and rewrites
it to answer the question a reader actually has -- why these moves -- rather
than arguing for novelty.
Removed: all self-assessment of distinctiveness. Replaced with a plain statement
of the relevant standard practice (PSLQ/LLL, Inverse Symbolic Calculator;
canonical numeration systems, base-k recognisable sets, Cobham) so a reader can
place the work without being told what to think of it.
The narrative now explains each move that looks arbitrary in isolation:
- why the seed data was treated as generated rather than given
- why a bijective codec was needed first, which is what the Radix framing and
DFA canonicalisation work is for
- why the Pascal basis was not a search: the matrix's own second row
(-u^3, -3u^2, -3u, -1) is a signed Pascal row, visible before any fitting
- what decoded (A, B, S) and why exact agreement makes it evidence
- how A, B factor through s2(tau_163) to reduce the problem to one CM value
- why the encoding is only a lead, with the proof built independently
- why the deformation r = 1/x exists: without it there is no contour
Adds a 'What did not work' section recording the three closed routes with their
witnesses (t-line intertwiner impossibility, L_U monodromy exclusion, Sym^2 V
set aside), since the indirectness of the final route is explained by them.
Retains the honest limits: 3.54x is not compression, and the claim should be
rejected.
Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WY6SfRYvm8zFKMX9GcjS8u
|
||
|---|---|---|
| docs/proofs | ||
| experiments/ramanujan_28/submission | ||