Nathan McNew

collaborators

2 papers

math.NT2026

Matchable numbers

Nathan McNew, Carl Pomerance

We say a natural number $n$ is matchable if there is a bijection from the set of $I ¨ (n)$ divisors of $n$ to the set ${1, 2, \dots, I ¨ (n)}$ , where corresponding numbers are relativel…

math.NT2026

On the densities of covering numbers and abundant numbers

Nathan McNew, Jai Setty

We investigate the densities of the sets of abundant numbers and of covering numbers, integers $n$ for which there exists a distinct covering system where every modulus divides $n$ …