-
Notifications
You must be signed in to change notification settings - Fork 0
/
Euler.py
134 lines (120 loc) · 2.74 KB
/
Euler.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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
def primecheck(n):
from math import sqrt
if n <= 1 or not isinstance(n, int): # type(n) != type(1):
return 0
elif n == 2 or n == 3:
return 1
elif n % 2 == 0:
return 0
else:
check = 0
for i in range(3, int(sqrt(n)) + 1, 2):
if n % i == 0:
check = 1
break
if check == 1:
return 0
else:
return 1
del(sqrt, i)
def prime_make(n):
import math
l = [True for i in range(n + 1)]
for i in range(n + 1):
if not i % 2:
l[i] = False
x = int(math.sqrt(n) + 1)
l[1] = False
l[2] = True
for i in range(3, x, 2):
if l[i]:
for j in range(2, n / i + 1):
l[i * j] = False
else:
continue
return [i for i in range(1, n + 1) if l[i]]
def factoring(n):
# from math import sqrt
primes = prime_make(n / 2 + 6)
xl = []
if n == 1:
xl.append(1)
elif n == 2:
xl.append(2)
elif n == 3:
xl.append(3)
for i in primes:
while n % i == 0:
xl.append(i)
n = n / i
if xl == []:
xl.append(n)
return xl
def pandigital_check(n, y=1):
if isinstance(n, str):
n = int(n)
checklst1 = list(set(list(str(n))))
checklst1.sort()
checklst2 = []
for i in range(len(str(n))):
checklst2.append(str(i + 1))
if y == 0:
checklst2.remove(checklst2[-1])
checklst2.append(str(0))
checklst2.sort()
if checklst1 == checklst2:
return 1
else:
return 0
def sum_numbers_expo(n, j=1):
n = str(n)
nlist = list(n)
for i in range(len(nlist)):
nlist[i] = int(nlist[i]) ** j
return sum(nlist)
def sum_divisors(n):
sum = 0
for i in range(1, n):
if n % i == 0:
sum += i
return sum
def is_kaibun(n):
if str(n) == str(n)[::-1]:
return True
else:
return False
def how_many_divisors(n):
# y=len(str(n))
xd = {}
i = 2
while n % i == 0:
if i in xd:
xd[i] += 1
else:
xd[i] = 1
n = n / i
i = 3
while n % i == 0:
if i in xd:
xd[i] += 1
else:
xd[i] = 1
n = n / i
i = 1
while i < n * 2:
while n % (6 * i - 1) == 0:
if 6 * i - 1 in xd:
xd[6 * i - 1] += 1
else:
xd[6 * i - 1] = 1
n = n / (6 * i - 1)
while n % (6 * i + 1) == 0:
if 6 * i + 1 in xd:
xd[6 * i + 1] += 1
else:
xd[6 * i + 1] = 1
n = n / (6 * i + 1)
i += 1
if xd.keys == []:
xd[i] = 1
return xd