Skip to content

Elementary prime number theory

yuuki edited this page Mar 6, 2025 · 7 revisions

primes.py

def is_prime(n: int) -> bool:
    """Determines if an integer is prime."""

    # 0, 1, and negative integers are not prime.
    if n <= 1:
        return False

    # If `n` is divisible by any integer `i` such
    # that 2 <= `i` <= `n` - 1, then it is not
    # prime.
    for i in range(2, n):
        if n % i == 0:
            return False

    # Otherwise, `n` is prime.
    return True


# Displays all prime numbers less than 100.
for i in range(1, 100):
    if is_prime(i):
        print(i)

Output

$ python primes.py
2
3
...
97