<P> Fib (0) = 0 as base case 1, (\ displaystyle (\ text (Fib)) (0) = 0 (\ text (as base case 1,))) </P> <P> Fib (1) = 1 as base case 2, (\ displaystyle (\ text (Fib)) (1) = 1 (\ text (as base case 2,))) </P> <P> For all integers n> 1, Fib (n): = Fib (n − 1) + Fib (n − 2). (\ displaystyle (\ text (For all integers)) n> 1, ~ (\ text (Fib)) (n): = (\ text (Fib)) (n - 1) + (\ text (Fib)) (n - 2).) </P> <P> Many mathematical axioms are based upon recursive rules . For example, the formal definition of the natural numbers by the Peano axioms can be described as: 0 is a natural number, and each natural number has a successor, which is also a natural number . By this base case and recursive rule, one can generate the set of all natural numbers . </P>

Explain the concept of recursion with example in hindi