Primes of the form x2 + ny2
By K. Gandhi. 2012
603 citations recorded by the source corpus.
Subfields: Theoretical Computer Science
View Paper: https://www.semanticscholar.org/paper/06a5f2a9f547907995523e0363e133f858d22dd1
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Theoretical Computer Science
Citations in the corpus
- Conjectures and results on $x^2$ mod $p^2$ with $4p=x^2+dy^2$ (2011, neutral): “, [C]), if p ≡ 1, 9 (mod 20) then p = x(2) + 5y(2) for some x, y ∈ Z; if p ≡ 3, 7 (mod 20) then 2p = x(2) + 5y(2) for some x, y ∈ Z.”
- Generic Polynomials Constructive Aspects Of The Inverse Galois Problem (2016, methodology): “This (being in the Exercises section) is of course only an overview, and we refer to [We3] (as well as [Cox]) for a complete treatment of the basic theory.”
- Galois representations attached to elliptic curves with complex multiplication (2018, background): “Notice, however, that jK,f is real (see, for instance, [5], p.”
- Trace formulas for Hecke operators, Gaussian hypergeometric functions, and the modularity of a threefold (2011, methodology): “When l|t, we use the following theorem from [3]:”
- Super congruences and Euler numbers (2010, neutral): “Cox [C]), if p ≡ 1 (mod 3) then there are unique x, y ∈ Z such that p = x(2) + 3y(2); if p ≡ 1, 3 (mod 8) (i.”