2. nthCircularPrime [70 pts] A circular prime is an integer number with the prop

Question

2. nthCircularPrime [70 pts] A circular prime is an integer number with the property that any rotation of that number's digits is prime. In this case, rotation refers to cycling the digits of a number; for example, the rotations of 1234 are 1234, 2341, 3412, and 4123. You can read more about this on the Wikipedia page. Single-digit primes are all circular, of course. To find the nth circular prime, you'll need to write isPrime and three other functions: 1. rotateNumber [20 pts] number's digits by one would turn the number 1234 to 4123. 2. isCircularPrime [30 pts] This function takes a non-negative integer number, x, and determines whether that number is a circular prime. To do this, you'll need to check whether every rotation of the number is prime. 3. nthCircularPrime [20 pts] This function takes a non-negative integer number n, and returns the nth circular prime.

Explanation / Answer

def nthCircularPrime(n): val = 1 while n >= 0: val += 1 if isCricularPrime(val): n-=1 return val

Related Questions

Navigate

• Browse (All)
• Browse 2
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.