Goldbach's conjecture

# n => isprime => bool ( true se è primo, false altrimenti )
def isPrime(n):
    numberOfDividents = 0
    for div in range(2, n):
        if(n % div == 0):
            numberOfDividents += 1
    return numberOfDividents == 0 and n != 1

# list every prime from 'from' to 'to'
# ex, getPrimes (1, 9) => [1,2,3,5,7]


def getPrimes(begin, end):
    foundPrimes = []

    for k in range(begin, end + 1):
        if(isPrime(k)):
            foundPrimes.append(k)

    return foundPrimes


def findPrimesWithSum(n):
    primes_to_try = getPrimes(2, n - 1)

    adding_to_n = []
    for i in range(0, len(primes_to_try)):
        for j in range(i, len(primes_to_try)):
            if(primes_to_try[i] + primes_to_try[j] == n):
                adding_to_n.append(
                    str(primes_to_try[i]) + '+' + str(primes_to_try[j])
                )

    return adding_to_n