"""Solution for problem 10
"""

N = 2000000
SIEVE = [True] * N


def mark(sieve, x):
    """This function marks prime numbers
    """
    for number in range(x + x, len(sieve), x):
        sieve[number] = False


def test_prime(n):
    """Tests if a number is prime
    """
    if SIEVE[n]:
        return True
    else:
        return False


def prime_euqation(n, a, b):
    return n ** 2 + a * n + b


def main():
    """main function
    """
    # run the sieve
    for x in range(2, int(N ** 0.5) + 1):
        if SIEVE[x]:
            mark(SIEVE, x)

    summe = 0
    for i in range(2, 2000000):
        if SIEVE[i]:
            summe += i

    print(f"The answer is {summe}.")


if __name__ == "__main__":
    main()

d30e36fb48e857d1df74189977af6c0054f66207
<mask token>


def mark(sieve, x):
    """This function marks prime numbers
    """
    for number in range(x + x, len(sieve), x):
        sieve[number] = False


def test_prime(n):
    """Tests if a number is prime
    """
    if SIEVE[n]:
        return True
    else:
        return False


def prime_euqation(n, a, b):
    return n ** 2 + a * n + b


<mask token>

<mask token>


def mark(sieve, x):
    """This function marks prime numbers
    """
    for number in range(x + x, len(sieve), x):
        sieve[number] = False


def test_prime(n):
    """Tests if a number is prime
    """
    if SIEVE[n]:
        return True
    else:
        return False


def prime_euqation(n, a, b):
    return n ** 2 + a * n + b


def main():
    """main function
    """
    for x in range(2, int(N ** 0.5) + 1):
        if SIEVE[x]:
            mark(SIEVE, x)
    summe = 0
    for i in range(2, 2000000):
        if SIEVE[i]:
            summe += i
    print(f'The answer is {summe}.')


<mask token>

<mask token>


def mark(sieve, x):
    """This function marks prime numbers
    """
    for number in range(x + x, len(sieve), x):
        sieve[number] = False


def test_prime(n):
    """Tests if a number is prime
    """
    if SIEVE[n]:
        return True
    else:
        return False


def prime_euqation(n, a, b):
    return n ** 2 + a * n + b


def main():
    """main function
    """
    for x in range(2, int(N ** 0.5) + 1):
        if SIEVE[x]:
            mark(SIEVE, x)
    summe = 0
    for i in range(2, 2000000):
        if SIEVE[i]:
            summe += i
    print(f'The answer is {summe}.')


if __name__ == '__main__':
    main()

<mask token>
N = 2000000
SIEVE = [True] * N


def mark(sieve, x):
    """This function marks prime numbers
    """
    for number in range(x + x, len(sieve), x):
        sieve[number] = False


def test_prime(n):
    """Tests if a number is prime
    """
    if SIEVE[n]:
        return True
    else:
        return False


def prime_euqation(n, a, b):
    return n ** 2 + a * n + b


def main():
    """main function
    """
    for x in range(2, int(N ** 0.5) + 1):
        if SIEVE[x]:
            mark(SIEVE, x)
    summe = 0
    for i in range(2, 2000000):
        if SIEVE[i]:
            summe += i
    print(f'The answer is {summe}.')


if __name__ == '__main__':
    main()

"""Solution for problem 10
"""

N = 2000000
SIEVE = [True] * N


def mark(sieve, x):
    """This function marks prime numbers
    """
    for number in range(x + x, len(sieve), x):
        sieve[number] = False


def test_prime(n):
    """Tests if a number is prime
    """
    if SIEVE[n]:
        return True
    else:
        return False


def prime_euqation(n, a, b):
    return n ** 2 + a * n + b


def main():
    """main function
    """
    # run the sieve
    for x in range(2, int(N ** 0.5) + 1):
        if SIEVE[x]:
            mark(SIEVE, x)

    summe = 0
    for i in range(2, 2000000):
        if SIEVE[i]:
            summe += i

    print(f"The answer is {summe}.")


if __name__ == "__main__":
    main()
