def solve(n): tStart = time.time() fastPrimeCheck = primes.primesArrayUpTo(10**n) largestPrime = 7 numb = '123456789' numb = numb[0:n] for p in all_perms(numb): if int(p) > largestPrime and fastPrimeCheck[int(p)]: largestPrime = int(p) print("Run Time = " + str(time.time() - tStart)) print('Ergebnis: ', largestPrime)
def solve(max): tStart = time.time() list = [2, 5] primeList = primes.primesUpTo(max) fastPrimeCheck = primes.primesArrayUpTo(max) for p in primeList: if not '2' in str(p) and not '5' in str(p): noPrime = False for q in allcyc_perms(str(p)): noPrime = noPrime or not fastPrimeCheck[int(q)] if not noPrime: list.append(p) print("Run Time = " + str(time.time() - tStart)) print('Ergebnis: ', list) print('Ergebnis: ', len(list))
def solve(m, p): tStart = time.time() primesList = primes.primesArrayUpTo(p) #Array der Form[False(0), False(1), True(2), True(3), False(4)...] primeListLength, outA, outB = 0, 0, 0 for a in range(-m,m): for b in range(0,m): n = 0 while primesList[func(a,b,n)]: n += 1 if n > primeListLength: primeListLength = n outA = a outB = b print("Run Time = " + str(time.time() - tStart)) print('Primzahlen: ', primeListLength) print('Ergebnis: a=', outA, ', b= ', outB, ' ab= ', outA*outB)
def solve(max, n, m): tStart = time.time() primeList = [] primeList = primes.primesUpTo(max) isPrime = primes.primesArrayUpTo(max) print("Anzahl Primzahlen: ", len(primeList)) longestList = [] for i in range(n, m): temp = primeList[i:] s = sum(temp) while len(temp) > len(longestList): if s < 1000000 and isPrime[s]: longestList = temp s -= temp[-1:][0] temp = temp[:-1] print(len(longestList)) print(sum(longestList)) print("Run Time = " + str(time.time() - tStart))