blob: af7725e75b4feaf67d416f56c1959ddef99fd704 (
plain)
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
|
## Remarks
## https://en.wikipedia.org/wiki/Achilles_number
import numpy as np
import math
def GetUniqueCount(arrList):
arrObj = np.array(arrList)
return np.unique(arrObj, return_counts = True)
def IsPrime(nInput):
for nDiv in range(2, int(math.sqrt(nInput)) + 1):
if nInput % nDiv == 0:
return False
return True
def PrimeFact(nOrigInput):
nInput = nOrigInput
arrPrimeFact = []
if IsPrime(nInput):
arrPrimeFact.append(nInput)
return arrPrimeFact
for nDiv in range(2, nOrigInput):
while nInput % nDiv == 0 and nInput > 0:
nInput = nInput / nDiv
arrPrimeFact.append(nDiv)
if nInput == 0:
break
return arrPrimeFact
def IsAchillesNum(nInput):
## print (nInput)
arrPrime, arrCount = GetUniqueCount(PrimeFact(nInput))
## print (arrPrime)
## print (arrCount)
## Check Is Powerful
if min(arrCount) == 1:
return False
## Check Is Perfect
if math.gcd(*arrCount) > 1:
return False
return True
## print (PrimeFact(37))
## print (IsAchillesNum(36))
## print (IsAchillesNum(72))
## print (IsAchillesNum(144))
nCount = 0
nLoop = 2
while nCount < 20:
if IsAchillesNum(nLoop):
print(nLoop)
nCount = nCount + 1
nLoop = nLoop + 1
|
