Miana–Ohtsuka–Romero's Catalan triangle odd-power congruence

About 8 years old · traced to

Let Cn,k:=n−2kn(nk)=(n−1k)−(n−1k−1)C_{n,k}:=\frac{n-2k}{n}{n\choose k}={n-1\choose k}-{n-1\choose k-1}, with the Catalan triangle relation Bn,k=C2n,n−kB_{n,k}=C_{2n,n-k}. Let nn and aa be positive integers with n>an>a, and let rr be a non-negative integer. Miana–Ohtsuka–Romero's conjecture. The sum of odd powers satisfies

∑k=0aCn,k2r+1≡0(mod(n−1a)).\sum_{k=0}^{a}C_{n,k}^{2r+1}\equiv 0\pmod{{n-1\choose a}}.

This is the second conjecture announced in the paper, whose abstract says that it is proved by establishing a qq-analogue; the source develops the proof through the stated congruence and related polynomial results.

References

Primary source

Victor J. W. Guo and Xiuguo Lian, “Proofs of two conjectures on Catalan triangle numbers”, arXiv:1806.02685 (2018).

Progress summary

Refreshed
Claimed solved

A 2018 paper claims to prove the conjecture using a stronger polynomial version, but the proof has not been independently verified here.

Miana, Ohtsuka, and Romero conjectured that the sum of the odd powers of the first a+1a+1 Catalan-triangle entries is divisible by the relevant binomial coefficient for all allowed positive integers and non-negative powers.

Known results

Earlier work by Guo and Zeng, and by Guo and Wang, established only special cases, according to the later paper.

2018 claimed proof

The paper states that it confirms the conjecture by proving qq-analogues for the associated Catalan-triangle sums. Specializing q=1q=1 yields the stated congruence and equivalent congruences for Bn,kB_{n,k} and An,kA_{n,k}. No retrieved source reports a counterexample, correction, withdrawal, or dispute.

Current status (as of September 2026): The conjecture is claimed proved by the 2018 qq-analogue paper, but that resolution remains unverified in this record.

Sources

Solutions 0

No solutions have been posted yet.