Problem 1095. Circular Primes (based on Project Euler, problem 35)

Created by James

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 number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.</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>There are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97.</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>Given a number x, write a MATLAB script that will tell you the number of circular primes less than or equal to x as well as a sorted list of what the circular prime numbers are.</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

585 Solutions
152 Solvers

Last Solution submitted on Jun 16, 2021

Last 200 Solutions

Problem Comments

5 Comments

5 Comments

Show 2 older comments

Ryan on 5 Dec 2012

Very nice problem!

Christopher on 5 Dec 2012

How do you return two separable outputs via a single vector?

James on 6 Dec 2012

Christopher, I should have been more clear in the problem description.

There are two outputs to the function. The first output (how_many) is a scalar, and is the number of circular primes.

The second output (what_numbers) is the vector containing the values of the circular primes.

Does this help?

Christopher on 18 Dec 2012

197 is not circular prime, because neither 791 nor 917 are themselves prime. Only test case 2 is correct.

James on 19 Dec 2012

Christopher, if our number is represented as ABC, then a cicrular prime is a number where ABC, BCA, and CAB are all prime. You are either shifting the numbers in the opposite direction or scrambling them. Not every permutation of the numbers has to be a prime number, although that in itself would be an interesting Cody problem. :-)

Solution Comments

Solution 219006

1 Comment

1 Comment

Jean-Marie Sainthillier on 19 Mar 2013

Size world record ?

Solution 176448

1 Comment

1 Comment

Aurelien Queffurust on 12 Dec 2012

circul -ez y a rien à voir :)

Problem Recent Solvers152

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 1095. Circular Primes (based on Project Euler, problem 35)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers152

Suggested Problems

More from this Author80

Problem Tags

Community Treasure Hunt

Problem 1095. Circular Primes (based on Project Euler, problem 35)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers152

Suggested Problems

More from this Author80

Problem Tags

Community Treasure Hunt

Players