2017/10/21 by Mallesham, Kummari
#FOS: Mathematics #Number Theory (math.NT)
paper · doi:10.48550/arxiv.1710.07768
We obtain an upper bound for the number of pairs (a,b) ∈ A× B such that a+b is a prime number, where A, B ⊆ \1,...,N \ with |A||B| ≫ \fracN2(log N)2, N ≥ 1 an integer. This improves on a bound given by Balog, Rivat and Sárközy.