You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Great job. Maybe a faster version could be implemented using Data.Bits.shiftR
7
Testing is ok, however, variations of workload would be really valuable
9
Why not starting in 4? Since you know that 2 and 3 are not composite
5
Implementation is buggy. Check (Main> checkComposites 5 (composites2 1000)** Exception: answers_lab6_WG_5.hs:(61,1)-(67,49): Non-exhaustive patterns in function checkComposites). IT can be improved by continuing the test even after finding the first false positive, and printing all the found false positives
6
Analysis is ok. But you are not discussing Charmichael numbers. In your analysis, you are not taking into account that a Carmichael number N fools the Fermat test if you check aˆ(N−1) for some a that is coprime with N. An analysis on that direction is needed
6
Issues
6
Issues
0
The text was updated successfully, but these errors were encountered:
The text was updated successfully, but these errors were encountered: