arXiv · 2405.12310
Sparse Admissible Sets and a Problem of Erdős and Graham
Abstract
Erdő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 infinite admissible sets that cannot be translated into a subset of the primes, thus answering this question in the negative. We present three additional constructions as well.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Desmond Weisenberg. 2024-10-21. Sparse Admissible Sets and a Problem of Erdős and Graham. https://doi.org/10.5281/zenodo.13909172
Cite the original work for its findings. Save a collection to share your selection of sources.