  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.
