Sur les plus grands facteurs premiers d'un entier
✍ Scribed by Jean-Marie Koninck
- Publisher
- Springer Vienna
- Year
- 1993
- Tongue
- English
- Weight
- 864 KB
- Volume
- 116
- Category
- Article
- ISSN
- 0026-9255
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
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.
Let n=n~ + n2 +... + nj a partition H of n. One will say that this partition represents the integer a if there exists a subsum nq + ni2 + "" + ni~ equal to a. The set g(H) is defined as the set of all integers a represented by/7. Let ~ be a subset of the set of positive integers. We denote by p(~C,n