Abstract
Let Φ(x,y) denote the number of integers n∈[1,x] free of prime factors ≤y. We show that but for a few small cases, Φ(x,y)<.6x/logy when y≤x.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have