Search

Using a new approach starting with a residue computation, we sharpen some of the known estimates for the counting function of friable integers. The improved accuracy turns out to be crucial for various applications, some of which concern fundamental questions in probabilistic number theory.

An integer is said to be $y$-friable if its greatest prime factor is less than $y$. In this paper, we obtain estimates for exponential sums over $y$-friable numbers up to $x$ which are non-trivial when $y\,\ge \,\exp \left\{ c \right.\sqrt{\log \,x\,}\log \,\log \,\left. x \right\}$. As a consequence, we obtain an asymptotic formula for the number of $y$-friable solutions to the equation $a\,+\,b\,=\,c$ which is valid unconditionally under the same assumption. We use a contour integration argument based on the saddle point method, as developped in the context of friable numbers by Hildebrand and Tenenbaum, and used by Lagarias, Soundararajan and Harper to study exponential and character sums over friable numbers.

Search Results

Refine search

Refine search

Actions for selected content:

2 results

Une nouvelle approche dans la théorie des entiers friables

Sommes friables d'exponentielles et applications

Search Results

Refine search

Refine search

Actions for selected content:

Save Search

2 results

Une nouvelle approche dans la théorie des entiers friables

Sommes friables d'exponentielles et applications