def h(x):

(d,n) = (1,0)
while d <= x:
(d,n) = (d*3,n+1)
return(n)
print (h(19685))
def g(n):
s=0
for i in range(2,n):
if n%i == 0:
s = s+1
return(s)
print (g(36) - g(35))
def f(n):
s=0
for i in range(1,n+1):
if n//i == i and n%i == 0:
s = 1
return(s%2 == 1)
print (f(43*43))
def foo(m):
if m == 0:
return(0)
else:
return(m+foo(m-1))
print (foo(5))

def primeproduct(num):
boolean isPrime=False
# If given number is greater than 1
if num > 1:
# Iterate from 2 to n / 2
for i in range(2, num):
# If num is divisible by any number between
# 2 and n / 2, it is not prime
if (num % i) == 0:
isPrime=False
break
else:
isPrime=True

else:
isPrime=False