7. Suppose Python function div(n) returns a list containing all the divisors of
ID: 3674284 • Letter: 7
Question
7. Suppose Python function div(n) returns a list containing all the divisors of integer n. For instance, div(6) returns [1, 2, 3, 6]. Write a Python function, call it prime(n), that uses div(n) and return 'Yes' or 'No', depending on whether n is prime or not. For instance, prime(8) should return 'No' whereas prime(7) should return 'Yes'.
8. Write a function, call it Fib(n), that prints out the first n numbers in the Fibonacci sequence, which is 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144... (each of the numbers after the first two in the sequence is the sum of the two numbers preceding it)
Explanation / Answer
def recur_fibo(n): """Recursive function to print Fibonacci sequence""" if n =2 and iRelated Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.