1 citations · 1 across the 12 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.NT2026
Utilizing Smoothing Techniques to Bound
Andrew Christensen, Kyle Pratt
We demonstrate an improved explicit upper bound of for using smoothing techniques. Our method sharpens previous bounds relying on the Riemann--Sieg…
math.NT2026
Binomial coefficients with divisors avoiding an interval
Hung M. Bui, Slava Naprienko, Kyle Pratt +1
We solve a fifty-year-old conjecture of Erdős and Graham concerning whether the binomial coefficient with must always have a divisor $\l…