References: [ Home | Author index | Key index | Search ]

Item(s) in original BibTeX format

@article{FI97,
	author={J. Friedlander and H. Iwaniec},
	title={Using a Parity-Sensitive Sieve to Count Prime Values of a Polynomial},
	journal= pnas,
	volume= 94,
	year= 1997,
	pages={1054--1058},
	mrnumber={98b:11097},
	annote={The authors announce that for the first time it is possible to show that
		a "thin" polynomial such as $x^2 +y^4$ takes on an infinite number of prime
		values--fewer than $n^{3/4}$ of the integers less than $n$ have this form.
		Complete proof to appear later in the Annals of Mathematics.}
}