← All problems

Odd Catalan-triangle power congruence conjecture

17 years old · traced to

Let Bn,kB_{n,k} denote the Catalan-triangle quantities used in the paper, and let n,r⩾1n,r\geqslant 1. Odd-power Catalan-triangle congruence conjecture.

∑k=1nBn,k2r+1≡(2n−1n)(mod(2nn))\sum_{k=1}^n B_{n,k}^{2r+1}\equiv {2n-1\choose n}\pmod{{2n\choose n}}

if and only if n=2a−2bn=2^a-2^b for some 0⩽b<a0\leqslant b<a. This gives a binary characterization of the indices for which the stated congruence holds; the paper presents computational examples but no proof of the general assertion.

References
  1. Victor J. W. Guo and Jiang Zeng, “Factors of binomial sums from the Catalan triangle”, arXiv:0909.0307 (2009).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.