Is there any efficient way of sieving prime numbers from the set of squarefree numbers? If so, is this any simpler a task than sieving from the set of natural numbers?
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
Here's how it works:
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
Even if you had a magic function that returned the $n$th square-free integer in zero time, I don't see how you could use it to build a sieve. And of course there is no such magic function.