2000 character limit reached
Primes values of $a^2 + p^4$ (1504.00531v3)
Published 2 Apr 2015 in math.NT
Abstract: We prove an asymptotic formula for the number of primes of the shape $a2 +p4$, thereby refining the well known work of Friedlander and Iwaniec. Along the way, we prove a result on equidistribution of primes up to $x$, in which the moduli may be almost as large as $x2$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.