Guo–Jouhet–Zeng divisibility conjectures for alternating binomial products

Let r,s,tr,s,t and nn be positive integers, and set

Sr,s,t(n)=k=nn(1)k(6n3n+k)r(4n2n+k)s(2nn+k)t.S_{r,s,t}(n)=\sum_{k=-n}^{n}(-1)^k\binom{6n}{3n+k}^r\binom{4n}{2n+k}^s\binom{2n}{n+k}^t.

Also set

Tr,s,t(n)=k=nn(1)k(8n4n+k)r(4n2n+k)s(2nn+k)t.T_{r,s,t}(n)=\sum_{k=-n}^{n}(-1)^k\binom{8n}{4n+k}^r\binom{4n}{2n+k}^s\binom{2n}{n+k}^t.

Guo–Jouhet–Zeng's divisibility conjecture. For all positive integers r,s,t,nr,s,t,n,

Sr,s,t(n)0(mod2(6nn)),S_{r,s,t}(n)\equiv 0\pmod{2\binom{6n}{n}}, Sr,s,t(n)0(mod6(6n3n)).S_{r,s,t}(n)\equiv 0\pmod{6\binom{6n}{3n}}.

Furthermore, if (r,s,t)(1,1,1)(r,s,t)\ne(1,1,1), then

Tr,s,t(n)0(mod2(8n3n)).T_{r,s,t}(n)\equiv 0\pmod{2\binom{8n}{3n}}.

These claims refine divisibility phenomena for alternating products of binomial coefficients. The source presents them as computer-experiment conjectures and supplies no resolution evidence in the provided text.

Sources & referencesView supporting material

Primary source

Hui-Qin Cao and Hao Pan, “Factors of alternative binomials sums”, arXiv:0903.3767 (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.