ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For positive integers rr, ss, tt, and nn, define

S6(r,s,t;n)=∑k=−nn(−1)k(6n3n+k)r(4n2n+k)s(2nn+k)t.S_{6}(r,s,t;n)= \sum_{k=-n}^n(-1)^k{6n\choose 3n+k}^r{4n\choose 2n+k}^s{2n\choose n+k}^t.

The 6n divisibility conjecture. For all positive rr, ss, tt, and nn, S6(r,s,t;n)S_{6}(r,s,t;n) is divisible by both

2(6nn)and6(6n3n).2{6n\choose n}\qquad\text{and}\qquad 6{6n\choose 3n}.

This conjecture refines the preceding divisibility result, which gives divisibility by (6nn){6n\choose n} and (6n3n){6n\choose 3n}. The paper reports computational verification for r+s+t≤10r+s+t\leq 10 and n≤100n\leq 100, but no general proof is given.

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.