arXiv · 2111.07157
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.
Explore related subjects
Keep this discovery
Carl Pomerance. 2021-11-13. Coprime matchings. https://arxiv.org/abs/2111.07157
Cite the original work for its findings. Save a collection to share your selection of sources.