ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For positive integers nn and rr, define

Rn,r=∑k=0n(n+k2k)(2kk)12k−2r−1.R_{n,r}=\sum_{k=0}^{n}{n+k\choose 2k}{2k\choose k}\frac{1}{2k-2r-1}.

Divisibility conjecture for shifted sums. There exists an integer ara_r, independent of nn, such that

ar∑k=0n−1(2k+1)Rk,r2≡0(modn).a_r\sum_{k=0}^{n-1}(2k+1)R_{k,r}^2\equiv 0\pmod n.

This is motivated by numerical calculation and asserts uniform divisibility after multiplication by a constant depending only on rr. The source gives no proof or resolution.

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.