def is_prime(n):
    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

def next_prime(n):
    candidate = n + 1
    while not is_prime(candidate):
        candidate += 1
    return candidate

def sum_with_next_prime(num):
    if is_prime(num):
        next = next_prime(num)
        result =num +next
        print(f"{num} is a prime Sum with the next prime {next} is: {result}")
    else:
        print(f"{num} is not a prime")

number=int(input("Enter a number: "))
sum_with_next_prime(number)

import math

def sieve_of_eratosthenes(n):
    is_prime=[True] *(n + 1)
    is_prime[0]=False
    is_prime[1] = False

    for p in range(2, int(math.sqrt(n)) + 1):
        if is_prime[p]:
            for multiple in range(p * p, n + 1, p):
                is_prime[multiple]=False

    primes= [ ]
    for i in range(2,n + 1):
        if is_prime[i]:
            primes.append(i)

    return primes

n = int(input("Find all prime numbers up to: "))
primes = sieve_of_eratosthenes(n)
print(f"Prime numbers up to {n} are:")
print(primes)

def quick_sort(arr):
    if len(arr)<=1:
        return arr

    pivot = arr[0]
    smaller =[x for x in arr[1:] if x < pivot]
    greater_or_equal= [x for x in arr[1:] if x >= pivot]

    return quick_sort(smaller) + [pivot] + quick_sort(greater_or_equal)