Anonymous user
Miller–Rabin primality test: Difference between revisions
m
→{{header|Bc}}: let 2 be prime
(bc (gnu)) |
m (→{{header|Bc}}: let 2 be prime) |
||
Line 45:
auto d, r, a, x, s;
if ( (n % 2) == 0) { return(0); }▼
if ( n <= 3) { return(1); }
▲ if ( (n % 2) == 0) { return(0); }
# find s and d so that d*2^s = n-1
| |||