Big biases amongst products of two primes

DOI10.1112/S0025579315000339MaRDI QIDQ2810737zbMATH OpenFDO

Authors David S. Dummit, Andrew Granville, Hershy Kisilevsky

Publication date 6 June 2016

Published in Mathematika (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1411.4594

zbMATH Keywords

arithmetic progressionquadratic characterprime number theoremproduct of primes

Mathematics Subject Classification ID

Sums over primes (11L20) Distribution of integers with specified multiplicative constraints (11N25)

Abstract: We show that substantially more than a quarter of the odd integers of the form $pq$ up to $x$, with $p,q$ both prime, satisfy $pequivqequiv3pmod4$.

Recommendations

• Chebyshev's Bias for Products of Two Primes
• On the distribution of products of two primes
• Large bias amongst products of two primes
• A lower bound for biases amongst products of two primes
• Chebyshev's bias for products of \(k\) primes

Cites work

• Chebyshev's Bias for Products of Two Primes
• The distribution of values of \(L(1,\chi_d)\)

Cited in

(9)

• Large bias amongst products of two primes
• Large bias for integers with prime factors in arithmetic progressions
• Products of two proportional primes
• A lower bound for biases amongst products of two primes
• Characterizations of quadratic, cubic, and quartic residue matrices
• Chebyshev's bias for products of irreducible polynomials
• Sums of two squares are strongly biased towards quadratic residues
• Chebyshev's bias for products of \(k\) primes
• On the distribution of products of two primes

This page was built for publication: Big biases amongst products of two primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2810737)