We give asymptotic estimates for the sums n x, p(n) y d(d(n)) and n x d(d(n))Âp(n), where d(n) is the divisor function and p(n) denotes the largest prime factor of n. 1996 Academic Press, Inc. n x |(d(n))=Cx+O(-x log 5 x) (1.3) article no.
Sur la proximité des diviseurs des entiers
✍ Scribed by A Raouj; A Stef
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 231 KB
- Volume
- 76
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
✦ Synopsis
a la me moire du professeur paul erdo s Denote, for r # N* and * 0, by E(r, *) the statement that, for almost all r-tuples (n 1 , n 2 , ..., n r ) # N r , there exist divisors
(2 j r).
In the case r=2, the first author proved that, if * 2 *=log 4&1, E(2, *) holds when *<* 2 * , but fails when *>* 2 * . In this paper, we study the case when r 3. We show that there exists a critical point * 3 *=&1+(3Â2) log 2 such that E(3, *) holds when *<* 3 * , but fails when *>* 3 * . We also show that for r 4, E(r, *) never holds.
📜 SIMILAR VOLUMES
The goal of this paper is to study sets of integers with an average sum of digits. More precisely, let g be a fixed integer, s(n) be the sum of the digits of n in basis g. Let f : N → N such that, in any interval [g , g +1 [, f (n) is constant and near from (g -1) /2. We give an asymptotic for the n
This paper is concerned with the quantity N(x, m), the number of positive integers n, 1 n x, for which 0(n)=m, where 0(n) denotes the total number of prime factors (counted with multiplicities) of n. The main purpose of this article is to present three powerful analytic methods, due, respectively, t
Reçu le 22 septembre 2002 ; accepté le 15 octobre 2002 Note présentée par Michèle Vergne. ## Résumé On donne une expression de la valeur optimale f c (y) du programme entier max{c Elle est une conséquence de la formule de Brion et Vergne qui évalue la somme x∈ (y)∩N n e c x . On montre que comme