Miller-Rabin primality test
Determine whether a 64-bit integer n is prime using deterministic Miller-Rabin (a fixed set of bases suffices for n < 2^64). Return True/False. Constraints: 0 <= n < 2^63. Handle 0, 1, and small primes correctly. Trial division alone would be far too slow for n near 10^18.
Implement
is_prime(n: int) → boolExamples
in
[561]outfalseWhat a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 35 min
solution.py
InputExpectedGot
[561]falsenot run yetsample