Problem 45429. Prime Sum

Created by Asif Newaz

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>What is the minimum value that can be written as sum of primes in n different ways?</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>For example, 10 is the minimum value that can be written as the sum of primes in exactly five different ways:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[ 2 + 2 + 2 + 2 + 2\n 2 + 2 + 3 + 3\n 2 + 3 + 5\n 5 + 5\n 3 +7]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>8 can be written in 3 different ways but 7 can also be written in 3 different ways. So 7 is the right answer.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:hyperlink w:docLocation=\"https://projecteuler.net/problem=77\"><w:r><w:t>&lt;https://projecteuler.net/problem=77</w:t></w:r></w:hyperlink><w:r><w:t>&gt;</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

10 Solutions
5 Solvers

Last Solution submitted on May 19, 2020

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

Rafael S.T. Vieira on 1 Oct 2020 at 21:58

what are the three ways to obtain 7 by summing primes?! 2+5, 2+2+3, and?

Rafael S.T. Vieira on 1 Oct 2020 at 22:14

Found at a blog that if a number is prime, wrongly some people consider this a sum. So the third way to obtain 7 would be 7 by itself, which is wrong, because it should actually be 7+0, but 0 is not a prime (and 7 by itself is not a sum). https://medium.com/@yevgeniy.v.filatov/counting-the-ways-to-express-a-number-as-a-sum-of-primes-e5e871b48193#:~:text=For%20the%20number%207%20we,as%20a%20sum%20of%20primes.

Problem Recent Solvers5

Problem Tags

euler primes projecteuler

Community Treasure Hunt

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

Start Hunting!

Problem 45429. Prime Sum

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers5

Suggested Problems

More from this Author149

Problem Tags

Community Treasure Hunt

Problem 45429. Prime Sum

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers5

Suggested Problems

More from this Author149

Problem Tags

Community Treasure Hunt

Players