ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers A≥C≥1A\geq C\geq 1 and B≥D≥1B\geq D\geq 1, define the Gaussian binomial coefficient by

[A+BiC+Di]:=∏0≤n≤C−1,0≤m≤D−1(A+Bi−(n+mi))∏1≤n≤C,1≤m≤D(n+mi).\left[\substack{A+Bi\\ C+Di}\right]:=\frac{\prod\limits_{\substack{0\leq n\leq C-1,\\0\leq m\leq D-1}}(A+Bi-(n+mi))}{\prod\limits_{\substack{1\leq n\leq C,\\1\leq m\leq D}}(n+mi)}.

Lucas congruence for Gaussian binomial coefficients. For positive integers A,B,C,DA,B,C,D for which these coefficients are defined,

[ ⁣pA+pBi\pC+pDi ⁣]≡[ ⁣A+BiC+Di ⁣](modp3).\left[\!\substack{pA+pBi\pC+pDi}\!\right]\equiv\left[\!\substack{A+Bi\\C+Di}\!\right]\pmod {p^3}.

This is proposed as a possible analogue of Lucas' theorem. The source notes that these coefficients are not generally Gaussian integers and that little is known about their properties, so the congruence 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.