fib
Calculate fibonacci sequence value at the nth position
This function computes the fibonacci number at position n using a recursive approach. The sequence starts with the provided initial values a and b, and continues according to the fibonacci rule where each number is the sum of the two preceding ones.
Arguments
a- The first number in the sequence (Fâ)b- The second number in the sequence (Fâ)n- The position in the sequence to calculate (0-indexed)
Returns
felt252- The nth number in the fibonacci sequence
Fully qualified path: alexandria_math::fibonacci::fib
pub fn fib(a: felt252, b: felt252, n: felt252) -> felt252