Anonymous user
Miller–Rabin primality test: Difference between revisions
→{{header|Erlang}}
(Add Erlang Implementation) |
|||
Line 597:
end.
Js = lists:seq(0, S),
lists:map(fun(J) -> pow_mod(A, math:pow(2, J)*D, N) end, Js).
{D, S} = find_ds(N),
not lists:any(fun(A) ->
case
[1|_] -> false;
L -> not lists:member(N-1, L)
Line 631:
is_prime(N) when N rem 2 == 0 -> false;
is_prime(N) when N < 341550071728321 ->
is_probable_prime(N) ->
first_1000() ->
| |||