Determining $x$ or $y$ mod $p^2$ with $p=x^2+dy^2$
Zhi-Wei Sun

TL;DR
This paper develops methods to determine specific coefficients x or y modulo p^2 in representations of primes p as x^2+dy^2 for d in {2,3,7}, using sum identities involving binomial coefficients and character sums.
Contribution
It introduces explicit sum formulas and congruences to compute x or y modulo p^2 in prime representations p=x^2+dy^2, extending previous results with new sum identities.
Findings
Derived congruences for x and y modulo p^2 in specific prime representations
Established sum identities involving binomial coefficients and character sums
Provided explicit formulas for sums involving binomial coefficients and powers for various m
Abstract
Let be an odd prime and let . When we can write with ; in this paper we aim at determining or modulo . For example, when , we show that if then where takes or according as or not, and that if then We also determine for .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Identities · Advanced Combinatorial Mathematics · Analytic Number Theory Research
