Matchable numbers

Abstract

We say a natural number $n$ is matchable if there is a bijection from the set of $\ddot{I}„(n)$ divisors of $n$ to the set $\{1,2,\dots ,\ddot{I}„(n)\}$, where corresponding numbers are relatively prime. We show that the set of matchable numbers has an asymptotic density, which we compute, and we show that every squarefree number is matchable. We also present some related unsolved problems.

Code to generate tables is included as an ancillary file