{"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","summary":"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.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-13","reactions":{},"formalized":true,"formalizes":[{"title":"Note on the parity of the partition function","identifier":"https://doi.org/10.7146/math.scand.a-10584","relationship":"formalizes"}]}