- Performance improvement in Number `squarefree_count(n)` for n > 2^40.
- Performance improvement in Number `squarefree_count(n)` for n > 2^40.

If Math::Prime::Util is installed, we now use it to iterate over the factored squarefree numbers <= sqrt(n).

trizen/sidef,trizen/sidef,trizen/sidef,trizen/sidef