Goldbach Conjecture functions

# returns True if num is prime, returns False otherwise
def isPrime(num):
    if num < 2:
        return False
    for n in range(2, int(num**0.5)):
        if num % n == 0:
            return False
    return True

# if num is even and greater than 2, returns the two primes that 
# sum to num (or -1 if Goldbach Conjecture is false)
# otherwise returns None
def checkGoldbach(num):
    if num % 2 == 0:
        for i in range(2, int(num/2) + 1):
            if isPrime(i) and isPrime(num - i):
                return i, num - i
        return -1
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s