# The polynomial $X^2+Y^4$ captures its primes

@article{Friedlander1998TheP,
title={The polynomial \$X^2+Y^4\$ captures its primes},
author={John B. Friedlander and Henryk Iwaniec},
journal={Annals of Mathematics},
year={1998},
volume={148},
pages={945-1040}
}
• Published 1 November 1998
• Mathematics
• Annals of Mathematics
This article proves that there are infinitely many primes of the form a^2 + b^4, in fact getting the asymptotic formula. The main result is that \sum_{a^2 + b^4\le x} \Lambda(a^2 + b^4) = 4\pi^{-1}\kappa x^{3/4} (1 + O(\log\log x / \log x)) where a, b run over positive integers and \kappa = \int^1_0 (1 - t^4)^{1/2} dt = \Gamma(1/4)^2 /6\sqrt{2\pi}. Here of course, \Lambda denotes the von Mangoldt function and \Gamma the Euler gamma function.
143 Citations
Search for primes of the form $m^2+1$
The results of the computer hunt for the primes of the form $q = m^2+1$ up to $10^{20}$ are reported. The number of sign changes of the difference $\pi_q(x) - \frac{C_q}{2}\int_2^x{du \over On the equations$x^2-2py^2 = -1, \pm 2$Let$E\in\{-1, \pm 2\}$. We improve on the upper and lower densities of primes$p$such that the equation$x^2-2py^2=E$is solvable for$x, y\in \mathbb{Z}$. We prove that the natural density of Spins of prime ideals and the negative Pell equation$x^{2}-2py^{2}=-1$• Mathematics Compositio Mathematica • 2018 Let$p\equiv 1\hspace{0.2em}{\rm mod}\hspace{0.2em}4$be a prime number. We use a number field variant of Vinogradov’s method to prove density results about the following four arithmetic invariants: Spacing and A Large Sieve Type Inequality for Roots of a Cubic Congruence. Motivated by a desire to understand the distribution of roots of cubic congruences, we re-derive a parametrization of roots$\nu \pmod m$of$X^3 \equiv 2 \pmod m$found by Hooley. Although this On the Number of Divisors of the Quadratic Form m2 + n2 • Gang Yu • Mathematics Canadian Mathematical Bulletin • 2000 Abstract For an integer$n$, let$d\left( n \right)\$ denote the ordinary divisor function. This paper studies the asymptotic behavior of the sum $$S\left( x \right)\,:=\sum\limits_{m\le x,n\le Conjectures on Representations Involving Primes We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any On the squarefree values of a^4+b^3 • Mathematics • 2021 In this article, we prove that the density of integers a, b such that a + b is squarefree, when ordered by max{|a|, |b|}, equals the conjectured product of the local densities. We show that the same The Hyperbolic Lattice Point Count in Infinite Volume with Applications to Sieves We develop novel techniques using abstract operator theory to obtain asymptotic formulae for lattice counting problems on infinite-volume hyperbolic manifolds, with error terms which are uniform as The integral part of a nonlinear form with a square, a cube and a biquadrate • Mathematics • 2020 Abstract In this paper, we show that if λ 1 , λ 2 , λ 3 {\lambda }_{1},{\lambda }_{2},{\lambda }_{3} are non-zero real numbers, and at least one of the numbers λ 1 , λ 2 , λ 3 {\lambda }_{1},{\lambda Bounded gaps between primes in multidimensional Hecke equidistribution problems Using Duke's large sieve inequality for Hecke Gr{\"o}ssencharaktere and the new sieve methods of Maynard and Tao, we prove a general result on gaps between primes in the context of multidimensional ## References SHOWING 1-10 OF 26 REFERENCES Modular Forms of Half Integral Weight The forms to be discussed are those with the automorphic factor (cz + d)k/2 with a positive odd integer k. The theta function$$ \theta \left( z \right) = \sum\nolimits_{n = - \infty }^\infty
On the Large Sieve Method
• Mathematics
• 1969
Let $$S\left( x \right) = \sum\limits_{n = M + 1}^{M + N} {a_n e\left( {nx} \right)\,\left( {e\left( \Theta \right) = e^{2\pi i\Theta } } \right)}$$ (1) where the a n are real or complex
Using a parity-sensitive sieve to count prime values of a polynomial.
• Mathematics
Proceedings of the National Academy of Sciences of the United States of America
• 1997
The development of new methods that rigorously demonstrate the asymptotic formula in the case of this polynomial are reported and that are applicable to an infinite class of polynomials to which this one belongs.
The square-free sieve and the rank of elliptic curves
• Mathematics
• 1991
Let E be an elliptic curve over Q. A celebrated theorem of Mordell asserts that E(Q), the (abelian) group of rational points of E, is finitely generated. By the rank of E we mean the rank of E(Q).
On Ranks of Twists of Elliptic Curves and Power-Free Values of Binary Forms
• Mathematics
• 1995
Let E be an elliptic curve over Q. By the rank of E we shall mean the rank of the group of rational points of E. Mestre [31], improving on the work of Neron [34] (cf. [13], [39] and [46]), has shown
Bilinear forms with Kloosterman fractions
• Mathematics, Computer Science
• 1997
This paper considers general bilinear forms of the type Sχ(a,b; c) whereI is a segment of an arithmetic progression and Weil’s bound for the latter is applied.
A Simple Proof of Siegel's Theorem.
• D. Goldfeld
• Mathematics
Proceedings of the National Academy of Sciences of the United States of America
• 1974
A brief and simple proof of Siegel's celebrated theorem that h(d) >> d(1/2-[unk]), as d --> infinity, is given. Here h(d) denotes the class number of the quadratic field Q([unk]-d). Simple proofs
Asymptotic sieve for primes.
• Mathematics
• 1998
For a long time it was believed that sieve methods might be incapable of achieving the goal for which they had been created, the detection of prime numbers. Indeed, it was shown [S], [B] to be
On the Barban-Davenport-Halberstam theorem
is usually substantially bounded, the results obtained have been consistent with the expectation that the above variate over all reduced residues, mod k, has a distribution function, the first,
Bombieri’s sieve
• Mathematics
• 1996
Let a(n) denote a sequence of non-negative reals and A(x) the counting function $$A(x) = \sum\limits_{n \leqslant x} {a(n)}$$ (1.1)