← All problems

Lucas congruence for Gaussian binomial coefficients

1 year old · traced to

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+Bi\C+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.

References
  1. Nikita Kalinin, “Wolstenholme's theorem over Gaussian integers”, arXiv:2504.07978 (2025).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.