Recall that the Goldbach Conjecture states that any even number N greater than 2

Question

Recall that the Goldbach Conjecture states that any even number N greater than 2 may be written as the sum of two primes. In this exercise you wil write some code to verify this hypothesis (for moderately sized values of N). Write a Python function called goldbachCheck that takes an even integer argument N and returns a tuple (p,g) such that p+q-N ordered such that p S q Example: goldbachCheck (12) (5,7) Example: goldbachCheck(1234) (3, 1231) This problem has a timeout limit of 1 second and a memory usage limit of 1MB, so be sure to write semi-efficient code! Each input in the test cases will satisfy 4 S N 1000000. For example: Test Result print(goldbachCheck (12)) (5, 7)

Explanation / Answer

def isPrime(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 = i + 6
return True

  

def goldbachCheck(N):
for i in range(2, N):
if isPrime(i) and isPrime(N-i):
return (i, N-i)

print(goldbachCheck(4))

# copy pastable code: https://paste.ee/p/nuoxk

Related Questions

Navigate

• Browse (All)
• Browse R
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.