Python代码，用于验证一系列数字上的Legendre猜想

import math

def is_prime(num):
    if num < 2:
        return False
    for i in range(2, int(math.sqrt(num)) + 1):
        if num % i == 0:
            return False
    return True

def verify_legendre_conjecture(start, end):
    for n in range(start, end + 1):
        prime_found = False
        for x in range(n+1, 2*n):
            if is_prime(x):
                prime_found = True
                break
        if not prime_found:
            print(f"The Legendre conjecture is not satisfied for n = {n}")

# 输入要验证的数字范围
start = 2
end = 100

verify_legendre_conjecture(start, end)