ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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

[n]q=1−qn1−q.[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=0n−1q(n−k)2[n+kk]q2[n−1k]q2≡q(n−1)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.

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.