For 2 <= n <= 1000000, return True if n is prime. >>> is_prime(87) False >>> is_prime(23) True >>> is_prime(25363) False
(n: int)
| 28 | |
| 29 | |
| 30 | def is_prime(n: int) -> bool: |
| 31 | """ |
| 32 | For 2 <= n <= 1000000, return True if n is prime. |
| 33 | >>> is_prime(87) |
| 34 | False |
| 35 | >>> is_prime(23) |
| 36 | True |
| 37 | >>> is_prime(25363) |
| 38 | False |
| 39 | """ |
| 40 | return sieve[n] |
| 41 | |
| 42 | |
| 43 | def contains_an_even_digit(n: int) -> bool: |
no outgoing calls
no test coverage detected