5 citations · 12 across the 18 of their papers we have counts for
23 papers
Matchable numbers
Nathan McNew, Carl Pomerance
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…
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 for which there exists a distinct covering system where every modulus divides …
Links and the Diaconis-Graham Inequality
Christopher Cornwell, Nathan McNew
In 1977 Diaconis and Graham proved two inequalities relating different measures of disarray in permutations, and asked for a characterization of those permutations for which equali…
Short Interval Results For Powerfree Polynomials Over Finite Fields
Angel Kumchev, Nathan McNew, Ariana Park
Let be an integer and be a finite field with elements. We prove several results on the distribution in short intervals of polynomials in $\mathbb F_q[x…
The distribution of intermediate prime factors
Nathan McNew, Paul Pollack, Akash Singha Roy
Let denote the middle prime factor of (taking into account multiplicity). More generally, one can consider, for any , the -positio…
Explicit bounds for large gaps between squarefree integers
Angel Kumchev, Wade McCormick, Nathan McNew +3
We obtain explicit forms of the current best known asymptotic upper bounds for gaps between squarefree integers. In particular we show, for any , that every interval of th…