7 kyu
Circular Primes
399 of 441Nmistrata
Description:
Based on Project Euler problem 35
A circular prime is a prime in which every circular permutation of that number is also prime. Circular permutations are created by rotating the digits of the number, for example: 197, 971, 719. One-digit primes are circular primes by definition.
Complete the function that dertermines if a number is a circular prime.
There are 100 random tests for numbers up to 10000.
Algorithms
Similar Kata:
Stats:
| Created | Feb 3, 2016 |
| Published | Feb 3, 2016 |
| Warriors Trained | 924 |
| Total Skips | 14 |
| Total Code Submissions | 2398 |
| Total Times Completed | 441 |
| Python Completions | 399 |
| Ruby Completions | 59 |
| Total Stars | 11 |
| % of votes with a positive feedback rating | 93% of 142 |
| Total "Very Satisfied" Votes | 125 |
| Total "Somewhat Satisfied" Votes | 15 |
| Total "Not Satisfied" Votes | 2 |
| Total Rank Assessments | 10 |
| Average Assessed Rank | 6 kyu |
| Highest Assessed Rank | 6 kyu |
| Lowest Assessed Rank | 7 kyu |
