← Divide & Conquer

Micro-Drill #79 — Check prime

Divide & Conquer Target: 10s

Trial division up to sqrt(n) is the basic primality test. Used in number theory problems.

def is_prime(n):
    if n < 2: return False
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0: return False
    return True

Type it from memory. Go.

Practice Problems

← Micro #78 Micro #80 →