Euler/problem_005_00.py at master · dsmdavid/Euler · GitHub

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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
##Smallest multiple
##Problem 5
##2520 is the smallest number that can be divided by each of the numbers
##from 1 to 10 without any remainder.
##
##What is the smallest positive number that is evenly divisible by all
##of the numbers from 1 to 20?

import numpy as np
import time

def smallestnumber(Nmax):
    # find the list of prime numbers in range(Nmax)
    listprimes2ton = primesfrom2to(Nmax)
    numbers = np.arange(2,Nmax, dtype=np.float64)
    maxnumber = int(np.prod(numbers))
    print(maxnumber)
    for i in listprimes2ton:
        test_ar = np.ones(len(numbers),dtype=bool)
        print(i,test_ar)
        print(maxnumber % i ==0)
        print(numbers)
        print(maxnumber % numbers)
        print((maxnumber % numbers == 0).all())
        while maxnumber % i == 0 and ((maxnumber/i) % numbers == 0).all():
                maxnumber = maxnumber / i
                print(maxnumber, i)

##        if maxnumber % i == 0:
##            nmaxnumber = int(maxnumber/i)
##            print(nmaxnumber, maxnumber, i)
##            test_ar = (nmaxnumber % numbers == 0)
##            print(test_ar)
##            while test_ar.all():
##                print(test_ar)
##                nmaxnumber = maxnumber/i
##                print(nmaxnumber, maxnumber, i)
##                test_ar = (nmaxnumber % numbers == 0)
##                if test_ar.all():
##                    print(maxnumber)
##                    maxnumber = nmaxnumber
##                    print(maxnumber)

##    minnumb = listprimes2ton.prod(axis=0)
##    print(minnumb)
    return maxnumber


def primesfrom2to(n):
    """ Input n>=6, Returns a array of primes, 2 <= p < n """
    sieve = np.ones(n/3 + (n%6==2), dtype=np.bool)
    for i in range(1,int((n**0.5)/3+1)):
        if sieve[i]:
            k=3*i+1|1
            sieve[       k*k/3     ::2*k] = False
            sieve[k*(k-2*(i&1)+4)/3::2*k] = False
    return np.r_[2,3,((3*np.nonzero(sieve)[0][1:]+1)|1)]


def calculatedivisors(maxlimit):
    npdivisors = []
    k = 0
    while k == 0:

        for i in range(2, int(maxlimit/2)):

            if maxlimit % i == 0:
                npd = np.ones(len(npdivisors), dtype=bool)
                m = 0
                try:
                    for j in npdivisors:
                        if i % j == 0:
                            npd[m] = False
                            break
                        m += 1
                    if npd.all():
                        npdivisors.append(i)
                        product = 1
                        for element in npdivisors:
                            product = element * product
                        if product == maxlimit:
                            k = 1
                            return npdivisors


                except:
                    npdivisors.append(i)


    print(npdivisors)

    return npdivisors


def findpalind(Nmax):
    list1 = []
    for i in range(1, Nmax):
        list1.append(i)
    list1.reverse()
    list2 = list1[:]
    listpalind = set()
    m = 0
    while m == 0:
        for i in list1:
            for j in list2:
                k = i * j
                if str(k) == str(k)[::-1]:
##                    print("str(k) == str(k)[-1:1]", str(k), str(k)[::-1])
                    listpalind.add(k)
##                    print("appending ", k)
                    m = 1
##                    print(listpalind)
    return listpalind

def isPal(s):
    if len(s) <= 1:
        return True
    else:
        return s == s[::-1]
def checkpals(Nmax):
    val = 0
    for i in range(Nmax,1,-1):
        for j in range(Nmax,1,-1):
            if isPal(str(i*j)) and i*j > val:
                val = i*j
    return val


def delbart(t,n):
    if n > 0:
        print(t)
        if not (t%n):
            if delbart(t, n-1):
                return True
            else:
                return False
        else:
            return False
    else:
        return True


def main():
    start = time.time()
##    palind = findpalind(1000)
##    print(max(palind))
##    minnum = smallestnumber(20)
##    print(minnum)
##
    i = 20
    while not delbart(i,20):
        i +=20
    print(i)
    end = time.time()
    print(end -start)


main()