示例#1
0
def is_sqube(num):
	factors = euler_utils.get_factors(num)

	if len(factors()) != 2:
		return False

	a = factors()[0]
	b = factors()[1]

	if (math.pow(a,2) * math.pow(b,3) == num) or (math.pow(b,2) * math.pow(a,3) == num):
		return True

	return False
示例#2
0
def is_sqube(num):
    factors = euler_utils.get_factors(num)

    if len(factors()) != 2:
        return False

    a = factors()[0]
    b = factors()[1]

    if (math.pow(a, 2) * math.pow(b, 3)
            == num) or (math.pow(b, 2) * math.pow(a, 3) == num):
        return True

    return False
示例#3
0
def how_many_distinct_primes(num):
    factors = euler_utils.get_factors(num)
    return len(factors())
示例#4
0
def how_many_distinct_primes(num):
    factors = euler_utils.get_factors(num)
    return len(factors())