Open BertLisser opened 7 years ago
@BertLisser thanks for the feedback.
For 6a we print the report in the console:
> Exercise 6 (1)
Exercise 6: Smallest number in J. Chernick's subset of carmichael numbers that passes Miller-Rabin
K = 1, minimum 'prime': 9624742921 can be divided by [1171,2341,3511], average value of primes found: 9624742921
K = 2, minimum 'prime': 1343656902505249 can be divided by [60727,121453,182179], average value of primes found: 1343656902505249
K = 5, minimum 'prime': 14199746960672563681 can be divided by [1332631,2665261,3997891], average value of primes found: 14199746960672563681
For 6b we check the first 10 mersenne numbers here: https://github.com/software-engineering-amsterdam/ST2017_WG_14/blob/master/Lab6/Final/Exercises.hs#L250 which we print as a result in the terminal as a report:
> Exercise 6 (2)
Comparing first 10 mersenne primes: True
Clear structured code. 6a
Report incomplete 6a(<-7)
6b
Report is incomplete. No answer for the question: Check whether the numbers that you found are genuine Mersenne primes. 6b (<-5)
7 (<-10)