Explicit bounds for Buchstab's function

2026/07/24 by Andreas Weingartner
Mathematics · #math.NT

paper · pdf

Abstract

Buchstab's function ω(u) describes the distribution of integers without small prime factors. We establish numerically explicit upper and lower bounds for ω(u) that are easy to evaluate, without the need to solve the delay differential equation numerically.

Related

• The distribution of k-free numbers
• A Natural Probabilistic Model on the Integers and its Relation to Dickman-Type Distributions and Buchstab's Function
• Limiting distributions of the classical error terms of prime number theory
• A note on variants of Buchstab's identity
• A lower bound for Cusick's conjecture on the digits of n+t