fix: Handle 6k + 1 candidates properly
#943
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
* Before this change, calling `find_next_prime` with a candidate which satisfies `6k + 1` pattern did not work. This pattern was only later in the loop, but not for the original `n` argument. * Use `u32` as a type for `n`. It's safe to convert `u32` into `f64` without precission loss.
6b3b686 to
0547139
Compare
ananas-block
approved these changes
Jul 3, 2024
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
find_next_primewith a candidate which satisfies6k + 1pattern did not work. This pattern was only later in the loop, but not for the originalnargument.u32as a type forn. It's safe to convertu32intof64without precission loss.