maths/number_theory/is_prime.py

import gradio as gr


def is_prime(n: int) -> bool:
    """Check if a number is a prime number."""
    if n <= 1:
        return False
    if n <= 3:
        return True
    if n % 2 == 0 or n % 3 == 0:
        return False
    i = 5
    while i * i <= n:
        if n % i == 0 or n % (i + 2) == 0:
            return False
        i += 6
    return True


is_prime_interface = gr.Interface(
    fn=is_prime,
    inputs=[gr.Number(label="Number", precision=0)],
    outputs="text",  # Outputting as text to give a clear True/False message
    title="Prime Number Check",
    description="Check if a number is a prime number. A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself.",
    examples=[[2], [17], [18], [1], [0], [97]],
)