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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2003-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/S016117120320418X |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|