Delphi.science

A finite counterexample for strict consecutive totient patterns

Source: github.com/AItoBit/erdos415-lean/tree/9a4f222785f486a2ba60c…

Alexander

Palomar Registrypalomar/PALOMAR-2026-10-15-000006Oct 15, 2026math.NTscore 0

Formalizes the finite counterexample at cutoff 826 from Proposition 1.2 of Przemek Chojecki's Consecutive Totient Patterns. With ranks assigned to positions and an inclusive cutoff, every strict length-three permutation occurs, no increasing length-four block occurs, and a decreasing length-four block does occur. Hence the largest universal length is three and decreasing is not always absent at the first non-universal length. This is a partial negative result for a specified reading of Erdos Problem 415; no novelty, asymptotic result or natural weak-order frequency result is claimed.

RepositoryJSON

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-10-15-000006
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-15-000006/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-10-15-000006/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'