-
Notifications
You must be signed in to change notification settings - Fork 0
/
Problem 35 Circular Primes.py
58 lines (45 loc) · 1.23 KB
/
Problem 35 Circular Primes.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
def is_prime(num):
if not 2 and num % 2 == 0:
return False
for i in range(3, int(num**.5) + 1, 2):
if num % i == 0:
return False
return True
def calc_prime_array(max):
prime_array = [2]
for i in range(3, max + 1, 2):
if is_prime(i):
prime_array.append(i)
return prime_array
def num_to_digit_array(num):
array = []
for digit in range(len(str(num))):
array.append(int(str(num)[digit]))
return array
def digit_array_to_num(array):
num = ''
for digit in range(len(array)):
num += str(array[digit])
return int(num)
def rotate_array(array):
array = array[1:] + array[0:1]
return array
def all_prime(array):
for number in array:
if not is_prime(number):
return False
return True
def answer():
prime_array = calc_prime_array(1000000)
count = 0
for prime in prime_array:
rotations = [prime]
array = num_to_digit_array(rotations[0])
for i in range(0, len(array) - 1):
array = rotate_array(array)
rotations.append(digit_array_to_num(array))
if all_prime(rotations):
print(rotations)
count += 1
print(count)
answer()