-
Notifications
You must be signed in to change notification settings - Fork 0
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
Lab 6: 6a, 6b, 7 #8
Comments
Hello Bert, thank you for your feedback. You are indeed right that isP is a bit strange since it is a typing error Concerning the low value for k: We explicitly chose a small value for k to improve our performance. We talked about this in our discussion - all outputted numbers are always pseudoprimes, no matter how large k is. The "Great Internet Mersenne Prime Search" uses the same approach - they try to identify candidates with a very unsafe algorithm (similar to MR with a low k) and then validate if the candidate really is a prime number. Prof. Curtis Cooper (creator of the GIMP project) explains this approach in this interview we watched before the implementation: https://www.youtube.com/watch?v=q5ozBnrd5Zc Our goal was to find the largest Mersenne prime possible with limited resources and time. It is always necessary to validate large primes found with a non-reliable algorithm like MR - no matter if k = 100 or k = 1. See in Exercise6b.hs:
Maybe you could take our discussion into consideration. I would not use a larger |
6a(<-10)
Nice clear presentation.
6b
I don't understand
isP <- f 2
You have luck with parameter
1
. Sometimes it detects pseudoprimes.6b(<-8)
7 (<-10)
The text was updated successfully, but these errors were encountered: