Problem 241. Project Euler: Problem 7, Nth prime

Created by Doug Hull

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>By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>What is the Nth prime number?</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Thank you to</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://projecteuler.net/problem=7\"><w:r><w:t>Project Euler Problem 7</w:t></w:r></w:hyperlink></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

2852 Solutions
1091 Solvers

Last Solution submitted on Nov 24, 2022

Last 200 Solutions

Problem Comments

4 Comments

4 Comments

Show 1 older comment

John D'Errico on 22 Feb 2018

Aw drat. I was going to submit the n'th prime problem until I saw this.

John D'Errico on 22 Feb 2018

Sadly, I see there are too few test cases, and the problem is too easy to cook.

Jiawei Gong on 7 Apr 2020

why 'nthprime' not allowed?

Sachin Mysore on 15 Mar 2022

There's a really easy way to cheese this problem if you find it. It happens to lie in the comment John D'Errico made about there being too few test cases. I'd encourage you to do the problem properly without such a cheese

Solution Comments

Solution 1688905

1 Comment

1 Comment

Roche de Guzman on 8 Dec 2018

Another great problem!

Solution 1178077

1 Comment

1 Comment

yurenchu on 2 May 2017

This solution doesn't use any of the built-in MATLAB functions primes() or isprime(). It works for all integers N > 0, and requires only (N^0.75) iterations.

Solution 292972

2 Comments

2 Comments

Ramy Mohamed on 31 Jul 2013

I do not know how the size are computed. Would someone please tell me?. Thanks in advance.

David Verrelli on 12 Mar 2018

See https://au.mathworks.com/matlabcentral/about/cody/#solve_problems for basic concept. The best way to figure out the details is from experience — just try different alternatives.

Problem Recent Solvers1091

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 241. Project Euler: Problem 7, Nth prime

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers1091

Suggested Problems

More from this Author51

Problem Tags

Community Treasure Hunt

Problem 241. Project Euler: Problem 7, Nth prime

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers1091

Suggested Problems

More from this Author51

Problem Tags

Community Treasure Hunt

Players