def problem33():
# a/b
found = []
for a in range(10, 100):
for b in range(a + 1, 100):
if not b % 10 == 0 and easyFraction(a, b):
found.append((a, b))
a = product([d[0] for d in found])
b = product([d[1] for d in found])
return b // gcd(a, b)
def problem73a(): total = 0 from factorGenerating import genFactors for d in genFactors(12000): if d in [(1,)]: continue for n in genFactors(product(d)): r = product(n)/product(d) if relPrimeFromFactors(n,d) == 1 and r > 1/3 and r < 1/2: total += 1 return total
def problem69():
record = 0
for n in genProducts(10 ** 6, [2, 5, 7, 3, 11, 13, 17, 19, 21]):
if product(n) == 1:
continue
phi = product(n) / phiFromFactors(n)
if phi > record:
record = phi
recordN = n
return product(recordN)
def problem8():
l = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450"
return max([product([int(a) for a in l[i : i + 5]]) for i in range(0, len(l) - 3)])
def generateFactors(n,start,checker, factors=[]): if start <= n//product(factors): for a in checker[start:n//product(factors)]: yield factors + [a] for c in generateFactors(n,a,checker,factors+[a]): yield c
def maxOfMinnor(sub): sumOfColumn = product([sub[i][0] for i in range(0,4)]) sumOfRow = product([sub[0][i] for i in range(0,4)]) sumOfDiagonal = product([sub[i][i] for i in range(0,4)]) sumOfOffDiagonal = product([sub[3-i][i] for i in range(0,4)]) return max(sumOfRow,sumOfColumn, sumOfDiagonal,sumOfOffDiagonal)
