ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DkD_k denote the kkth central Delannoy number, defined by

Dk=∑j=0k(kj)(k+jj).D_k=\sum_{j=0}^k {k\choose j}{k+j\choose j}.

Central Delannoy congruence. If nn is a power of 22, then

∑k=0n−1(−1)k(2k+1)3Dk≡2n2(modn3).\sum_{k=0}^{n-1}(-1)^k(2k+1)^3D_k\equiv 2n^2\pmod{n^3}.

This refines earlier congruences for alternating sums involving central Delannoy numbers; its general validity for powers of 22 is the conjectural part.

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.