Propri\'et\'es multiplicatives des entiers friables translat\'es
Abstract
An integer is said to be y-friable if its greatest prime factor P(n) is less than y. In this paper, we study numbers of the shape n-1 when P(n)≤ y and n≤ x. One expects that, statistically, their multiplicative behaviour resembles that of all integers less than x. Extending a result of Basquin, we estimate the mean value over shifted friable numbers of certain arithmetic functions when ( x)c ≤ y for some positive c, showing a change in behaviour according to whether y / x tends to infinity or not. In the same range in (x, y), we prove an Erd\"os-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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.