ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let D(k)D(k) denote the Domb numbers, and let (un)n≥0(u_n)_{n\geq 0} and (vn)n≥0(v_n)_{n\geq 0} be the Lucas sequences defined by

u0=0,u1=1,un+1=11un−un−1(n=1,2,3,…),u_0=0,\quad u_1=1,\quad u_{n+1}=11u_n-u_{n-1}\quad(n=1,2,3,\ldots),

and

v0=2,v1=11,vn+1=11vn−vn−1(n=1,2,3,…).v_0=2,\quad v_1=11,\quad v_{n+1}=11v_n-v_{n-1}\quad(n=1,2,3,\ldots).

Congruences for Domb numbers and Lucas sequences. For every odd prime pp: (i) if one of the Legendre symbols (p3)(\frac{p}{3}) and (p13)(\frac{p}{13}) is 11, then

∑k=0p−1D(k)uk≡0(modp2).\sum_{k=0}^{p-1}D(k)u_k\equiv 0\pmod{p^2}.

Moreover, if (p3)=(p13)=1(\frac{p}{3})=(\frac{p}{13})=1, then

∑k=0p−1D(k)uk≡0(modp3).\sum_{k=0}^{p-1}D(k)u_k\equiv 0\pmod{p^3}.

(ii) If the Jacobi symbol (p39)(\frac{p}{39}) is −1-1, then

∑k=0p−1D(k)vk≡0(modp2).\sum_{k=0}^{p-1}D(k)v_k\equiv 0\pmod{p^2}.

These are further conjectural supercongruences relating Domb numbers to Lucas sequences; the supplied text gives no evidence of a proof or disproof.

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.