How do I write a recursive golden ratio?

[raxer007]

This is my code to compute the golden ratio using recursion written in python but it is not returning me the output that i want. How should i change it?


def recursive_phi(n):
if n<0 or n == 0:
return 0
elif n == 1:
return 1
else:
return recursive_phi(n-1) + recursive_phi(n-2)
return recursive_phi(n)/recursive_phi(n-1)

recursive_fib(10)

[VictorN]

What happens if n == 2?

[wolle]

How should i change it?

It looks like you're trying to use the fact that you get the golden ratio if you divide two consecutive numbers in the Fibonacci sequence?

Since I don't know any Python I have to cheat and search internet,

https://www.programiz.com/python-pro...acci-recursion

def recur_fibo(n):
   if n <= 1:
       return n
   else:
       return(recur_fibo(n-1) + recur_fibo(n-2))

This then will produce the golden ratio,

def recursive_phi(n):
       return(recur_fibo(n) / recur_fibo(n-1))

If it works it proves Python is so easy you don't need any Python knowledge at all to use it.

[2kaud]

If you just need the golden ratio then it can be calculated easily as

(1 + sqrt(5)) / 2

See https://www.mathsisfun.com/numbers/golden-ratio.html

[WandaAZ]

Exploring the elegance of recursive algorithms, crafting a recursive golden ratio is a mesmerizing journey into the harmonious world of mathematics. It's akin to composing a symphony of numbers, each iteration revealing a deeper layer of beauty. Embracing the Fibonacci sequence and the divine proportion, the recursive golden ratio becomes a poetic dance of numbers converging towards perfection. The recursive approach adds a layer of complexity, elevating the challenge and the joy of unraveling its mysteries. As you embark on this intellectual adventure, remember that every line of code is a stroke on the canvas of your creativity. If you ever need assistance, services like https://essaypro.com/write-my-coursework can be invaluable companions in your academic journey. Happy coding!