Prove that $f_n (l) = \frac{l}{l(n+1)+1}$ for all positive integers n.
If $f_{n+1}=f_0 \circ f_n$ and $f_{0} (l)=\frac{l}{l+1}$ for $n= 0,1,2,3....$
This proof has to be solved with the method of induction. Now, I ran into a problem with base cases. For the $f_n (l)$ the base case is 1 or n=1, but the base case for $f_{n+1}$ is $n=0$. So I don't know how to take this further or I might be completely thinking wrong.
The base case is in fact $n=0$ for which you need to prove that $$f_1=f_0Of_0$$since $$f_0Of_0(l)={f_0(l)\over f_0(l)+1}={{l\over l+1}\over {l\over l+1}+1}={l\over l+l+1}={l\over 2l+1}=f_1(l)$$hence the induction is complete.