def func():
primes2 = Euler10.func(7072)
primes3 = Euler10.func(369)
primes4 = Euler10.func(85)
lst = set()
for i in primes2:
for j in primes3:
for k in primes4:
x = i**2 + j**3 + k**4
if x < 50000000 and x not in lst:
lst.add(x)
return len(lst)
def func(top):
primes = Euler10.func(top)
for i in primes[::-1]:
c = 1
while pow(10, c, i) - 1 != 0:
c += 1
if i - c == 1:
return i
def func(top):
primes = Euler10.func(top)
for i in primes[::-1]:
c = 1
while pow(10, c, i) - 1 != 0:
c += 1
if i - c == 1:
return i
# for i in xrange(3, x, 2):
# if x%i != 0:
# primes.append(i)
# else:
# for i in xrange(2, x):
# if x%i != 0:
# primes.append(i)
# return (len(primes))
#
# maxi = 0
# maxi2 = 0
# for i in xrange(top):
# print relPrime(i)
# if i/relPrime(i) > maxi2:
# maxi = i
# maxi2 = i/relPrime(i)
#
# return maxi
#
#print func(10)
import Euler10
primes = Euler10.func(1000000)
ans = 1
i = 0
while ans * primes[i] < 1000000:
ans *= primes[i]
i += 1
print ans
# for i in xrange(3, x, 2):
# if x%i != 0:
# primes.append(i)
# else:
# for i in xrange(2, x):
# if x%i != 0:
# primes.append(i)
# return (len(primes))
#
# maxi = 0
# maxi2 = 0
# for i in xrange(top):
# print relPrime(i)
# if i/relPrime(i) > maxi2:
# maxi = i
# maxi2 = i/relPrime(i)
#
# return maxi
#
#print func(10)
import Euler10
primes = Euler10.func(1000000)
ans = 1
i = 0
while ans*primes[i] < 1000000:
ans *= primes[i]
i+=1
print ans
