Let p>3p>3 be a prime, a1,a2,a3∈Za1,a2,a3∈Z and let Np(x3+a1x2+a2x+a3)Np(x3+a1x2+a2x+a3) denote the number of solutions to the congruence x3+a1x2+a2x+a3≡0(modp)x3+a1x2+a2x+a3≡0(modp). In this paper, we give an explicit criterion for Np(x3+a1x2+a2x+a3)=3Np(x3+a1x2+a2x+a3)=3 via binary quadratic forms.
生成讲解博客的中文版本
生成AI智能校验的中文版本