Problem 60. The Goldbach Conjecture

Created by Cody Team

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://en.wikipedia.org/wiki/Goldbach's_conjecture\"><w:r><w:t>Goldbach conjecture</w:t></w:r></w:hyperlink><w:r><w:t> asserts that every even integer greater than 2 can be expressed as the sum of two primes.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Given the even integer n, return primes p1 and p2 that satisfy the condition n = p1 + p2. Note that the primes are not always unique. The test is not sensitive to order or uniqueness. You just need to meet the appropriate conditions.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Example:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[ Input  n = 286\n Output (any of the following is acceptable) \n        [  3 283]\n        [283   3]\n        [  5 281]\n        [107 179]\n        [137 149]]]></w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

11958 Solutions
5140 Solvers

Last Solution submitted on Jun 03, 2023

Last 200 Solutions

Problem Comments

16 Comments

16 Comments

Show 13 older comments

Mineralter on 26 Jun 2013

for n =10,p1=[3 5 7],p2=[7 5 3],is the correct answer. but the judgement is not allowed.

Robert Johansson on 10 Aug 2013

Nice one.

Alexander Razmyslov on 5 Feb 2015

Thank you very much! Its a really nice one!

Jonathan Campelli on 24 Feb 2015

Well made. I am still trimming down my code furiously. My favorite problem so far.

Matteo Tessarolo on 6 May 2016

Currently the best one for me!

Ahmed Abdelbasit on 12 Feb 2017

nice problem . I like problem related to prime numbers

Fabio Masino on 24 Aug 2017

Very nice problem!

Vincent Kroeze on 3 Jan 2018

this was a fun one

GEORGIOS BEKAS on 26 Jan 2018

something I am doing worng.
please help.

p1=[]
p2=[]
for i = 1:5000
x1 = ceil(286*rand(1));
x2 = ceil(286*rand(1));
s = x1+x2;
a =isprime(x1);
b=isprime(x2);
if a==1 && b==1 && s ==n
p1=x1
p2=x2
end
end
[p1 p2]

Jiahang Li on 1 Feb 2018

cool

Da Lu on 7 Mar 2018

有中国的小伙伴吗？

Pablo López on 8 Feb 2019

Really interesting the Goldbach conjecture!

Olivia Li on 29 May 2019

有中国的小伙伴呀

heart on 9 Feb 2020

At first,I thought I should find all the possible answers.But I misunderstood the text............

BURAK BAL on 15 May 2020

nice question

Noora Al Suwaidi HCT2021 on 15 Mar 2021

perfect nice

Solution Comments

Show comments

Problem Recent Solvers5140

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 60. The Goldbach Conjecture

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers5140

Suggested Problems

More from this Author96

Problem Tags

Community Treasure Hunt

Problem 60. The Goldbach Conjecture

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers5140

Suggested Problems

More from this Author96

Problem Tags

Community Treasure Hunt

Players