Primitive and geometric-progression-free sets without large gaps
Number Theory
2019-02-06 v2 Combinatorics
Abstract
We prove the existence of primitive sets (sets of integers in which no element divides another) in which the gap between any two consecutive terms is substantially smaller than the best known upper bound for the gaps in the sequence of prime numbers. The proof uses the probabilistic method. Using the same techniques we improve the bounds obtained by He for gaps in geometric-progression-free sets.
Cite
@article{arxiv.1809.08355,
title = {Primitive and geometric-progression-free sets without large gaps},
author = {Nathan McNew},
journal= {arXiv preprint arXiv:1809.08355},
year = {2019}
}
Comments
10 pages, corrected proof of Theorem 2.2