Graph Regularised Hashing code
-
Updated
Nov 30, 2020 - MATLAB
Graph Regularised Hashing code
Route C of 3: RH via growth contradiction on X₀(143) g=13. Littlewood 1924 Ω: |ζ(1/2+it)|=Ω(exp(c log t/log log t)) contradicts |ζ|≤C(log t)² → Ingham Deuring-Heilbronn c1=0.209>0.2 β>0.9 closed at p5 → S₄={2,3,19,191} C=11.422>2√13 → GRH → H₄ 12/11 → RH. Lean 4.12 0 sorry. Companion to Route A & B.
Add a description, image, and links to the grh topic page so that developers can more easily learn about it.
To associate your repository with the grh topic, visit your repo's landing page and select "manage topics."