blob: c00483bcecfe14deee4deaf8dd1f925d2330a6e3 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
|
#
# n/phi(n) is a maximum, if phi(n) is minimal
#
# phi(n) = n*(1-1/p1)*(1-1/p2)*...*(1-1/pi)
# n/phi(n) = 1/((1-1/p1)*(1-1/p2)*...*(1-1/pi))
# -> smallest primes
#
from common import sieve
primes = sieve(100).primes()
prime_list = [ x for x in primes ]
prime_list.sort()
x = 1
for p in prime_list:
if x*p > 1000000:
break
x *= p
print x
|
