Delphi.science

The Minimum Number of Coprime Adjacencies in a Permutation

Source: github.com/gsidoine/coprime-adjacencies-lean/tree/4ccf4a1d9…

Guillaume Sidoine

Palomar Registrypalomar/PALOMAR-2026-11-09-000001Nov 9, 2026math.COscore 0

A Lean 4 formalization of the exact minimum number of coprime adjacent pairs over all permutations of the first n positive integers, valid unconditionally for every n at least four. The proof constructs optimal paths in the graph joining noncoprime integers.

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