We prove lower bounds of the form for the number of primes up to 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 subtleties to the local criteria for representation of a shifted prime: for example, some shifted quadratic forms of discriminant 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 [FFH+24]

生成讲解博客的中文版本

生成AI智能校验的中文版本