Problem 1119. sum of non-primes

Created by li jian

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","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\"?><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 sum of the non-primes no larger than 10 is 1+4+6+8+9+10=38</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Find the sum of all the positive non-prime integers that do not exceed the input, N.</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

587 Solutions
291 Solvers

Last Solution submitted on Oct 23, 2020

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

Vincent on 13 Dec 2012

The description of the problem is slightly misleading. It says the sum "below" 10, yet the sum includes 10. It should be ammended to "Find the sum of all the non-primes below the input, and including the input, N.", or something to that effect.

John D'Errico on 22 Feb 2018

I've now fixed the problem statement to be consistent.

Problem Recent Solvers291

Problem Tags

isprimes poor_problem_statement

Community Treasure Hunt

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

Start Hunting!