aboutsummaryrefslogtreecommitdiff
path: root/challenge-168/eric-cheung/python/ch-2.py
blob: 4bcd6f1e3ab093375d89e7b04966572ce510d3bb (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
## Remarks
## https://en.wikipedia.org/wiki/Home_prime

import math

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 = []

    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 ConcatArray(arrInput):

    strResult = ""

    for arrElem in arrInput:
        strResult = strResult + str(arrElem)

    return int(strResult)


## print (PrimeFact(511))
## print (ConcatArray(PrimeFact(511)))
## print (ConcatArray(PrimeFact(8)))


nOrigInputNum = 10

nInputNum = nOrigInputNum

while not IsPrime(nInputNum):
    nInputNum = ConcatArray(PrimeFact(nInputNum))

print ("HP(" + str(nOrigInputNum) + ") = " + str(nInputNum))