5 papers
Explicit bounds for Buchstab's function
Andreas Weingartner
Buchstab's function describes the distribution of integers without small prime factors. We establish numerically explicit upper and lower bounds for that are easy t…
Explicit bounds for Dickman's function
Andreas Weingartner
Dickman's function denotes the natural density of integers whose largest prime factor does not exceed . We establish numerically explicit upper and lower bounds…
A link between error terms when counting smooth and rough numbers
Andreas Weingartner
We establish a relationship between error terms appearing in estimates for the counting functions of smooth and rough numbers. We then apply this link to obtain an explicit upper b…
Exceptions to the Erd\H os--Straus--Schinzel conjecture
Carl Pomerance, Andreas Weingartner
A famous conjecture of Erd\H os and Straus is that for every integer , can be represented as , where are positive integers. This conjecture was ge…
An extension of smooth numbers: multiple dense divisibility
Garo Sarajian, Andreas Weingartner
The -tuply -densely divisible numbers were introduced by a Polymath project, as a weaker condition on the moduli than -smoothness, in distribution estimates for primes in…