Write a code to print the fibonacci series upto n terms using recursive function.

Write a recursive Python function named pgcd, to find and return the Greatest Common Divisor (GCD) of two numbers x and y passed in parameters. • Test it gcd (1234,4321) gcd (8192,192)

Using recursion, write a function sum that takes a single argument n and computes the sum of all integers between 0 and n inclusive. Do not write this function using a while or for loop. Assume n is non-negative. def sum(n): """Using recursion, computes the sum of all integers between 1 and n, inclusive. Assume n is positive. >>> sum(1) 1 >>> sum(5) # 1 + 2 + 3+ 4+ 5 15 "*** YOUR CODE HERE ***"

1. Given, nCr= n! (n-r)!r!" Write a function to compute nCr without recursion.

In program C Write a recursive function find_sum(n)that calculates the sum of successive integers starting at 1and ending at n(i. e., find_sum( n) = 1 + 2 . . .+( n -1) + n.

1. Write a recursive function to generate the Fibonacci sequence.