ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let S(m,n)S(m,n) denote the super Catalan numbers

S(m,n)=(2mm)(2nn)(m+nm).S(m,n)=\frac{\binom{2m}{m}\binom{2n}{n}}{\binom{m+n}{m}}.

For an odd prime pp, let (p3)\left(\frac{p}{3}\right) denote the Legendre symbol. Apagodu's conjecture. For any odd prime pp,

∑i=0p−1∑j=0p−1S(i,j)≡(p3)(modp),\sum_{i=0}^{p-1}\sum_{j=0}^{p-1}S(i,j)\equiv \left(\frac{p}{3}\right)\pmod{p},

and

∑i=0p−1∑j=0p−1(3i+3j+1)S(i,j)≡−7(p3)(modp).\sum_{i=0}^{p-1}\sum_{j=0}^{p-1}(3i+3j+1)S(i,j)\equiv -7\left(\frac{p}{3}\right)\pmod{p}.

These are congruences concerning double sums of the super Catalan numbers. The source paper presents them as conjectures of Apagodu and proves the two congruences using Zeilberger's algorithm.

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.