dubious doc for smallFactors

Issue #13 new
Qiang Luo
created an issue

The doc for smallFactorers says

smallFactors bound n finds all prime divisors of n > 1 up to bound

In fact, if the remaing factor is a prime < the square of largest prime<=n, smallFactores will identify it. Sometimes it will find prime factor > n, for example

smallFactors 3 5

gives ([(5,1)],Nothing)

It's better to clarity this or ensure return factors <= bound