import math
def goldbach_partitions(n):
    primes = []
    paritions = []

    if n%2 != 0: return []
    for i in range(0, n+1):
        if i > 1:
            for j in range(2, int(math.sqrt(i))+1):
                if (i % j) == 0:
                    break
            else:
                primes.append(i)

    for i in primes:
        if i + i == n:
            s = str(i) + '+' + str(i)
            paritions.append(s)

        for j in range(0, len(primes)):
            if primes[j] > i:
## tu nie kumam, bo jak zrobie (for j in range(i, len(primes)):) to nie działą dobrze...
                if i + primes[j] == n:
                    s = str(i) + '+' + str(primes[j])
                    paritions.append(s)

    return(paritions)