Propriétés multiplicatives des entiers friables translatés

preprint2014arXivOpen access

Abstract

An integer is said to be yy-friable if its greatest prime factor P(n) is less than yy. In this paper, we study numbers of the shape n−1n-1 when P(n)≤yP(n)\leq y and n≤xn\leq x. One expects that, statistically, their multiplicative behaviour resembles that of all integers less than xx. Extending a result of Basquin, we estimate the mean value over shifted friable numbers of certain arithmetic functions when (log⁡x)c≤y(\log x)^c \leq y for some positive cc, showing a change in behaviour according to whether log⁡y/log⁡log⁡x\log y / \log\log x tends to infinity or not. In the same range in (x,y)(x, y), we prove an Erdös-Kac-type theorem for shifted friable numbers, improving a result of Fouvry and Tenenbaum. The results presented here are obtained using recent work of Harper on the statistical distribution of friable numbers in arithmetic progressions.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.