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

• Created by James
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Back to Alphabet

• 10 Problems
• 65 Finishers

Handling Functions

• 16 Problems
• 13 Finishers

Like (10)

Difficulty:

(65)

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

33.03% Correct | 66.97% Incorrect

• 2210 Solutions
• 639 Solvers

Last Solution submitted on Nov 22, 2025

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Join Cody Contest 2025 — Have Fun and Win Prizes!

We’re excited to invite you to Cody Contest 2025! 🎉 Pick a team,...

Problem Recent Solvers639

Suggested Problems

• 02 - Vector Variables 2

  706 Solvers

• Sum of odd numbers in a matrix

  609 Solvers

• Plot Damped Sinusoid

  10019 Solvers

• Temperature Conversion 3

  1514 Solvers

• Velocity Conversion

  1531 Solvers

More from this Author80

• Crunch that matrix!

  95 Solvers

• High Precision Square Root (Inspired by Project Euler 80)

  30 Solvers

• A matrix of introverts

  73 Solvers

• S-T-R-E-T-C-H I-T O-U-T

  75 Solvers

• String math

  26 Solvers