A prime-power qq-binomial congruence

From papers

Let pp be a prime, let nn be a power of pp, and define the qq-integer by

[n]q=1qn1q.[n]_q=\frac{1-q^n}{1-q}.

For Gaussian binomial coefficients, write [ab]q{a\brack b}_q. Prime-power qq-binomial congruence. Then

k=0n1q(nk)2[n+kk]q2[n1k]q2q(n1)2[n]q(mod[p]qn/p2).\sum_{k=0}^{n-1}q^{(n-k)^2}{n+k\brack k}_q^2{n-1\brack k}_q^2\equiv q^{(n-1)^2}[n]_q\pmod{[p]_{q^{n/p}}^2}.

This is a qq-analogue of congruences for binomial sums at prime-power parameters; the excerpt does not state whether it has been proved or remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Victor J. W. Guo and Jiang Zeng, “New congruences for sums involving Apery numbers or central Delannoy numbers”, arXiv:1008.2894 (2012).

Solutions 0

No solutions have been posted yet.