Delphi.science

Kolberg's theorem: the partition function takes each parity infinitely often

Source: github.com/VictorLiwentao/fc-palomar-proofs/tree/9b2a1eeaa6…

Wentao Li

Palomar Registrypalomar/PALOMAR-2026-11-13-000019Nov 13, 2026math.NTscore 0

The partition number p(n) is even for infinitely many n and odd for infinitely many n (Kolberg 1959). The proof uses Euler's pentagonal number theorem over F_2.

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