On a thin set of integers involving the largest prime factor function
For each integer n≥2, let P(n) denote its largest prime factor. Let S:={n≥2:n does not divide P(n)!} and S(x):=#{n≤x:n∈S}. Erdős (1991) conjectured that S is a set of zero density. This was proved by Kastanas (1994) who established that S(x)=O(x/logx). Recently, Akbik (1999) proved that S(x)=O(x exp...
Main Authors: | Jean-Marie De Koninck, Nicolas Doyon |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2003-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Online Access: | http://dx.doi.org/10.1155/S016117120320418X |
Similar Items
-
On the difference of values of the kernel function at consecutive
integers
by: Jean-Marie De Koninck, et al.
Published: (2003-01-01) -
Gaussian integers with small prime factors
by: D. G. Hazlewood
Published: (1979-01-01) -
On Integers, Primes and UniqueFactorization in Quadratic Fields
by: Hedenlund, Alice
Published: (2013) -
On matrices associated to prime factorization of odd integers
by: T. Bier
Published: (2008-12-01) -
On a Question of Wintner Concerning the Sequence of Integers Composed of Primes from a Given Set
by: Kim, Jeongsoo
Published: (2007)