Coprime matchings

Abstract

We prove that there is a matching between 2 intervals of positive integers of the same even length, with corresponding pairs coprime, provided the intervals are in $[n]$ and their lengths are $>c(\log n{)}^2$, for a positive constant $c$. This improves on a recent result of Bohman and Peng. As in their paper, the result has an application to the lonely runner conjecture.