ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be a prime and set r=(p−1)2r=(p-1)^2. Define

gp(x)=∏1≤n,m≤p−1(p,n2+m2)=1(x−(n+mi))=x(p−1)2+a1x(p−1)2−1+⋯+ar−1x+ar.g_p(x)=\prod_{\substack{1\leq n,m\leq p-1\\(p,n^2+m^2)=1}}(x-(n+mi))=x^{(p-1)^2}+a_1x^{(p-1)^2-1}+\cdots+a_{r-1}x+a_r.

Conjectural coefficient pattern. If p=4k+3>3p=4k+3>3, then

gp(x)≡1+x2(p−1)+x4(p−1)+⋯+x(p−1)2≡1−xp2−11−x2(p−1)(modp).g_p(x)\equiv 1+x^{2(p-1)}+x^{4(p-1)}+\cdots+x^{(p-1)^2}\equiv\frac{1-x^{p^2-1}}{1-x^{2(p-1)}}\pmod p.

If p=4k+1>5p=4k+1>5, then

gp(x)≡1+b1xp−1+b2x2(p−1)+⋯+x(p−1)(p−3)(modp),g_p(x)\equiv 1+b_1x^{p-1}+b_2x^{2(p-1)}+\cdots+x^{(p-1)(p-3)}\pmod p,

where bj≡aj(p−1)(modp)b_j\equiv a_{j(p-1)}\pmod p. The displayed pattern is based on computations; the source asks whether a closed formula for the coefficients bjb_j exists.

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.