Delphi.science

Collatz m-cycles for m ≤ 91 (conditional on Bařina's 2^71 check) and an explicit linear-form bound for log 2 and log 3

Source: github.com/hamsade-google/collatz-mcycles-lean/tree/a1fdeaa…

Hamed Sadeghi

Palomar Registrypalomar/PALOMAR-2026-11-15-000008Nov 15, 2026math.NTscore 0

Lean 4 / Mathlib formalization of two results. (1) An explicit lower bound for the linear form Λ = (K + L) log 2 − K log 3: for every K ≥ 2438425051595107335801557824 and every L, Λ cannot satisfy 0 < Λ < 100 · 2^(1 − K/2^68). This new self-contained bound is proved from Mathlib using explicit symmetric multipoint Padé approximants (the z = x(70 − x) kernel of Salikhov and Bouchelaghem–He–Li–Wu) together with an elementary bound on lcm(1, …, n), replacing the use of Rhin's (1987) effective irrationality measure in Collatz cycle arguments. (2) An independent proof of Hercher's (2023) theorem…

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-15-000008
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-15-000008/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-15-000008/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'