recursion
def is_divisible(x, y):
if x % y == 0:
return True
else:
return False
def is_power(a, b):
if a == 1 or b == 1: # a more succinct way to test base case
return a == 1
return is_divisible(a, b) and is_power(a/b, b) # divisible and recursions report True?