  In this paper, we solve a problem of Terence Tao. We prove that for any
$K\geq 2$ and sufficiently large $N$, the number of primes $p$ between $N$ and
$(1+\frac{1}{K})N$ such that $\mid kp+ja^{i}+l\mid$ is composite for all $1\leq
a, |j|, k\leq K$, $1\leq i \leq K\log N$ and $l$ in any set $L
=L_{N}\subseteq\{-KN,\cdots, KN\}$ of cardinality $K$ with $ja^{i}+l\neq0$ is
at least $C_{K}\frac{N}{\log N}$, where $C_{K}>0$ depending only on $K$.
