Cody

Problem 60. The Goldbach Conjecture

Solution 3708613

Submitted on 18 Nov 2020 by Predrag Vukovic
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
nList = 28:6:76; for i = 1:length(nList) n = nList(i); [p1,p2] = goldbach(n) assert(isprime(p1) && isprime(p2) && (p1+p2==n)); end

(28): 5 + 23 = 28 p1 = 5 p2 = 23 (34): 3 + 31 = 34 p1 = 3 p2 = 31 (40): 3 + 37 = 40 p1 = 3 p2 = 37 (46): 3 + 43 = 46 p1 = 3 p2 = 43 (52): 5 + 47 = 52 p1 = 5 p2 = 47 (58): 5 + 53 = 58 p1 = 5 p2 = 53 (64): 3 + 61 = 64 p1 = 3 p2 = 61 (70): 3 + 67 = 70 p1 = 3 p2 = 67 (76): 3 + 73 = 76 p1 = 3 p2 = 73

2   Pass
nList = [18 20 22 100 102 114 1000 2000 36 3600]; for i = 1:length(nList) n = nList(i); [p1,p2] = goldbach(n) assert(isprime(p1) && isprime(p2) && (p1+p2==n)); end

(18): 5 + 13 = 18 p1 = 5 p2 = 13 (20): 3 + 17 = 20 p1 = 3 p2 = 17 (22): 3 + 19 = 22 p1 = 3 p2 = 19 (100): 3 + 97 = 100 p1 = 3 p2 = 97 (102): 5 + 97 = 102 p1 = 5 p2 = 97 (114): 5 + 109 = 114 p1 = 5 p2 = 109 (1000): 3 + 997 = 1000 p1 = 3 p2 = 997 (2000): 3 + 1997 = 2000 p1 = 3 p2 = 1997 (36): 5 + 31 = 36 p1 = 5 p2 = 31 (3600): 7 + 3593 = 3600 p1 = 7 p2 = 3593

Suggested Problems

More from this Author95

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!