python.p0035 Namespace Reference

Functions
def	rotations
def	main ()

Detailed Description

Project Euler Problem 35

This ended up being a filtering problem. The problem with my solution is that I
am not satisfied with my filter at all. I feel like there is a more efficient
way to go about it.

Problem:

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.

How many circular primes are there below one million?

Function Documentation

def python.p0035.main

(

int

)

Here is the call graph for this function:

def python.p0035.rotations

(

x

)

Here is the caller graph for this function: