ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For an odd positive integer kk and an integer nn satisfying

gcd⁡(n,k)=gcd⁡(n+1,k)=1,\gcd(n,k)=\gcd(n+1,k)=1,

let Nk(n)N_k(n) be the number of pairs of positive integers (b1,b2)(b_1,b_2) such that

b1,b2≤k−12,b1+b2≥k+12,b2≡nb1(modk).b_1,b_2\leq \frac{k-1}{2},\qquad b_1+b_2\geq \frac{k+1}{2},\qquad b_2\equiv nb_1\pmod{k}.

Parity conjecture. The number Nk(n)N_k(n) satisfies

Nk(n)≡⌊k+14⌋(mod2).N_k(n)\equiv \left\lfloor\frac{k+1}{4}\right\rfloor\pmod{2}.

This number-theoretic conjecture arose in the determination of spin parity for odd kk-differentials of parity type in genus zero and one. It is motivated by numerical evidence and is presented as the reduction of the geometric parity problem; its status is unresolved in the supplied source.

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.