2 citations · 2 across the 3 of their papers we have counts for
Showing math.NTShow all
3 papers · 1 filter
math.NT2023
Effective -unit Equations Beyond 3 Terms : Newman's Conjecture
Prajeet Bajpai, Michael A. Bennett
We show how to effectively solve 5-term -unit equations when the set of primes has cardinality at most 3, and use this to provide an explicit answer to an old question of D.…
math.NT2023
Arithmetic Progressions in Squarefull Numbers
Prajeet Bajpai, Michael A. Bennett, Tsz Ho Chan
We answer a number of questions of Erdős on the existence of arithmetic progressions in -full numbers (i.e. integers with the property that every prime divisor necessarily occur…
math.NT2016
Squares with three nonzero digits
Michael A. Bennett, Adrian-Maria Scheerer
We determine all integers such that has at most three base- digits for . More generally, we show that all solutions to equations of the s…