Primes represented by shifted quadratic forms: on primitivity and congruence classes

We prove lower bounds of the form ≫N/(logN)3/2 for the number of primes up to N primitively represented by a shifted positive definite integral binary quadratic form, and under the additional condition that primes are from an arithmetic progression. This extends the sieve methods of Iwaniec, who showed such lower bounds without the primitivity and congruence conditions. Imposing primitivity adds some subtle\-ties to the local criteria for representation of a shifted prime: for example, some shifted quadratic forms of discriminant 5(mod8) do not primitively represent infinitely many primes. We also provide a careful list of the local conditions under which a genus of an integral binary quadratic form represents an integer, verified by computer, and correcting some minor errors in previous statements. The motivation for this work is as a tool for the study of prime components in Apollonian circle packings.