Determining x or y mod p² with p=x^2+dy^2

arXiv1210.5237MaRDI QIDQ6236480FDOQ6236480

Authors: Zhi-Wei Sun 

Publication date: 18 October 2012

Abstract: Let $p$ be an odd prime and let $din2,3,7$. When $(frac-dp)=1$ we can write $p=x^2+d{y}^2$ with $x,yinmathbbZ$; in this paper we aim at determining $x$ or $y$ modulo $p^2$. For example, when $p=x^2+3y^2$, we show that if $pequivxequiv1pmod4$ then ${\displaystyle }$sum_{k=0}^{(p-1)/2}(3[3mid k]-1)(2k+1)frac{�inom{2k}k^2}{(-16)^k}equivleft(frac2p ight)2xpmod{p^2}${\displaystyle }$ where $[3midk]$ takes $1$ or $0$ according as $3midk$ or not, and that if $-pequivyequiv1pmod4$ then ${\displaystyle }$sum_{k=0}^{(p-1)/2}left(frac k3 ight)frac{k�inom{2k}k^2}{(-16)^k} equiv(-1)^{(p+1)/4}yequivsum_{k=0}^{(p-1)/2}(1-3[3mid k])frac{k�inom{2k}k^2}{(-16)^k}pmod{p^2}.${\displaystyle }$ We also determine ${\displaystyle }$sum_{k=0}^{p-1}frac{k�inom{2k}k^3}{m^k}sum_{kle j<2k}frac1jquad mbox{mod} p${\displaystyle }$ for $m=1,-8,16,-64,256,-512,4096$.

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Congruences; primitive roots; residue systems (11A07) Binomial coefficients; factorials; (q)-identities (11B65) Sums of squares and representations by other particular quadratic forms (11E25)

This page was built for publication: Determining $x$ or $y$ mod $p^2$ with $p=x^2+dy^2$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6236480)