  Erd\H{o}s and Graham asked whether any sparse enough admissible set of
natural numbers can be translated into a subset of the primes. By using a
greedy construction involving powers of primitive roots, we prove that there
exist arbitrarily sparse admissible sets that cannot be translated into a
subset of the primes, thus answering this question in the negative.
