def sum_rec(n):
if (n<=0):
return 0
result = sum_rec(n-1)+n
return result
# Recursion practices PGE
# Problem 11
# Recursive sum of non 3 divisible
n = input("Please, enter a number:\n")
n = int(n)
def sum_rec_11(n):
if (n<=0):
return 0
if (n%3==0):
result = sum_rec_11(n-1)
else:
result = sum_rec_11(n-1)+n
return result
print("Problem 11")
print(sum_rec_11(n))
# PAG Section D, problem 8
def recu_print_x(number_of_prints):
if number_of_prints < 1:
return
recu_print_x(number_of_prints-1)
print("x", end="")
def recu_problem_8(leg_size):
if leg_size < 1:
return
recu_problem_8(leg_size-1)
recu_print_x(leg_size)
print()
recu_problem_8(15)
# Recursion practices PGE
# Recursive Sum of Squares
n = input("Please, enter a number:\n")
n = int(n)
def sum_rec(n):
if (n<=0):
return 0
result = sum_rec(n-1)+n*n
return result
print("Sum of Squares Recursive")
print(sum_rec(n))
def rec_seq_downup( N, l = []):
if N < 0:
l.append(" bottom reached ")
return
l.append(N)
rec_seq_downup( N-1 )
l.append(N)
return l
res = rec_seq_downup(11)
print( res )
# Recursion practices PGE
# Recursive Sum
n = input("Please, enter a number:\n")
n = int(n)
def sum_rec(n):
if (n<=0):
return 0
result = sum_rec(n-1)+n
return result
print("Sum Recursive")
print(sum_rec(n))
#exit()
def sumrec( N ):
if( N <= 0 ):
return 0
res = sumrec( N-1 ) + N
return res
def r5( x, y ):
if x >= y: return x
return r5( x+1, y )
for N in range( 1, 10 ):
res = sumrec( N )
print( "sum of posit. int up to", N, " = ", res)
res = r5 (67, 111)
print ( res )
'''
for i in range( 1, 11):
for j in range( 1, 11 ):
res = r5( i, j )
print( i, j, " ", res )
'''
