-
Notifications
You must be signed in to change notification settings - Fork 39
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Log sieve #210
Log sieve #210
Conversation
5597676
to
f3e6d08
Compare
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Please do not forget to clean up trace
s and fix Travis build.
c05804c
to
4d9c43a
Compare
-- This routine takes the @sievedInterval@ as input, it first filters for smooth numbers | ||
-- using the given threshold and then checks which of the filtered numbers are smooth | ||
-- by computing their factorisation by trial division. | ||
findLogSmoothNumbers :: [Prime Int] -> Int -> Int -> [(Prime Integer, Word)] -> Integer -> V.Vector (Integer, Int) -> V.Vector (Integer, I.IntMap Int) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I suggest changing this function to take V.Vector Integer
and U.Vector Int
separately, and return Map Integer (I.IntMap Int)
immediately.
Sieving after taking logarithms