ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a nonnegative integer. Count the total number of parts across all partitions of nn whose parts are odd, and separately the total number of parts across all partitions of nn into distinct parts. A partition has exactly one even part when one even integer occurs as a part, possibly with repetition, and no other even integer occurs. Beck's conjecture. The excess of the first total over the second equals the number of partitions of nn with exactly one even part, possibly repeated. This conjecture relates the partition families in Euler's identity and refines the equality of their numbers by comparing their total numbers of parts; the supplied source does not indicate whether it has been resolved.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.