On a problem of Terence Tao

zbMATH Open1363.11003arXiv1510.03944MaRDI QIDQ3179848FDOQ3179848

Xue-Gong Sun

Publication date: 6 January 2017

Abstract: In this paper, we solve a problem of Terence Tao. We prove that for any $Kgeq2$ and sufficiently large $N$, the number of primes $p$ between $N$ and $(1+frac1K)N$ such that $midkp+j{a}^i+lmid$ is composite for all $1leqa,|j|,kleqK$, $1leqileqKlogN$ and $l$ in any set $L=L_{N}subseteq-KN,cdots,KN$ of cardinality $K$ with $j{a}^i+leq0$ is at least $C_{K}fracNlogN$, where $C_K>0$ depending only on $K$.

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

zbMATH Keywords

primesSelberg's sieve methodTerence Tao's problem

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Arithmetic progressions (11B25) Goldbach-type theorems; other additive questions involving primes (11P32)

Cited In (4)

• On Tao's “finitary” infinite pigeonhole principle
• Title not available (Why is that?)
• On the number of distinct prime factors of \(nj+a^hk\)
• On a problem of Tandori

This page was built for publication: On a problem of Terence Tao

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