
TL;DR
This paper introduces the concept of matchable numbers, characterizes their distribution, proves all squarefree numbers are matchable, and discusses related open problems.
Contribution
It defines matchable numbers, computes their asymptotic density, and establishes that all squarefree numbers are matchable, advancing understanding of their properties.
Findings
The set of matchable numbers has a positive asymptotic density.
All squarefree numbers are matchable.
The paper presents open problems related to matchable numbers.
Abstract
We say a natural number is matchable if there is a bijection from the set of divisors of to the set , 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
