Id: palomar/PALOMAR-2026-11-13-000019 Url: https://github.com/VictorLiwentao/fc-palomar-proofs/tree/9b2a1eeaa6d00172a8e08351ed43b896e21ce950 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-13-000019-v1.json Repo: https://github.com/VictorLiwentao/fc-palomar-proofs Tags: math.NT, math.CO, msc:11P83, msc:05A17 Score: 0 Title: Kolberg's theorem: the partition function takes each parity infinitely often Trust: high Domain: math.NT Source: palomar Authors: Wentao Li Reviews: 0 Subject: math.NT Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-13 Formalized: true Formalizes: title=Note on the parity of the partition function identifier=https://doi.org/10.7146/math.scand.a-10584 relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-13-000019 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.