# import pyprimesieve as sieve
from Utilities.PrimeFactor import prime_factors
if __name__ == '__main__':
# first trial, not as easy as it seems, this will overflow!
# print max([i[0] for i in sieve.factorize(600851475143)])
# second trial did my own version.
print max(prime_factors(600851475143))
def get_num_of_solutions(n):
factors = prime_factors(n)
return factors
# import pyprimesieve as sieve
from Utilities.PrimeFactor import prime_factors
if __name__ == '__main__':
# first trial, not as easy as it seems, this will overflow!
# print max([i[0] for i in sieve.factorize(600851475143)])
# second trial did my own version.
print max(prime_factors(600851475143))
def count_prime_factors(x):
return len(set(prime_factors(x)))
def count_prime_factors(x):
return len(set(prime_factors(x)))
