Anonymous user
Talk:Miller–Rabin primality test: Difference between revisions
→The pseudo-code from Wikipedia is [allegedly] broken: Not broken.
(→The pseudo-code from Wikipedia is [allegedly] broken: Not broken.) |
|||
Line 53:
To show this go to runbasic.com then click Write Your Own, and enter the source code and run. Then enter 31 as the number to test and any number of witness loops, it will return composite.
: The pseudocode is not broken. The Run Basic code is broken. It does not choose the bases correctly, and inverts the x=1 or x=n-1 test. [[User:Danaj|Danaj]] ([[User talk:Danaj|talk]]) 17:17, 11 March 2016 (UTC)
| |||