ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Q\mathcal{Q} be the set of primes specified in the paper, and let b21(n)b_{21}(n) denote the number of 2121-regular partitions of nn. Parity conjecture. If p∈Qp\in\mathcal{Q}, then

b21(11p2−56)≡1(mod2).b_{21}\left(\frac{11p^2-5}{6}\right)\equiv 1\pmod{2}.

A proof would show that the congruences obtained in the paper differ from those previously obtained for 2121-regular partitions.

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.