Prime checker

Trial division up to sqrt(n).

math loops

Implement `is_prime(n: int) -> bool`.

Return True if n is prime; False otherwise.

Constraints

0 ≤ n ≤ 10^7

Example

>>> is_prime(17)
True
>>> is_prime(4)
False

10 points ~10 min

Recent Submissions

No submissions yet — hit Run Tests to try!

Hints

Only check divisors up to sqrt(n); skip evens after 2.

Test Results

Press Ctrl+Enter or click Run Tests to execute your code.