Exemple #1
0
def solve():
    return max(prime_factors_large_n(600851475143))
Exemple #2
0
def num_divisors(n):
    p_factors = Counter(prime_factors_large_n(n))
    p_factors.update(p_factors.keys())  # Add '1' to every Counter entry
    return product(p_factors.values())