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

Created by James
Appears in Magic Numbers

Difficulty:Rate

Solve Later
Add To GroupÃ‚

The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.

There are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97.

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.

Solve

Solution Stats

2006 Solutions
575 Solvers

Last Solution submitted on Jul 09, 2025

Last 200 Solutions

Problem Comments

6 Comments

6 Comments

Show 3 older comments

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. :-)

Bùi Dương on 3 Dec 2023

good question! tricky

Solution Comments

Show comments

Problem Recent Solvers575

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 Solvers575

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 Solvers575

Suggested Problems

More from this Author80

Problem Tags

Community Treasure Hunt

Players