Anonymous user
Talk:Miller–Rabin primality test: Difference between revisions
m
→Erlang: Needs a power function that operates using BigNums.
m (Signed) |
m (→Erlang: Needs a power function that operates using BigNums.) |
||
Line 16:
::It is not the absence on the task page of a function name or that the only function with the mentioned parameter names (n and k) is not doing the ''algorithm'' that is my problem, although both these things makes it more difficult. My problem is that I can not see any of the exported functions doing the task. Therefore I think that the Erlang solution might not be correct. [[User:bengt]]
==
Miller-Rabin primality test in Erlang uses a floating point power function and truncation to restore to integer. This combination begins to fall short when the integer being tested is up to approximately 90,000,000. At these large sizes, the primes found are correct but too many correct primes are not found. By 100,000,000 no primes are being found.
== Tcl ==
| |||