0 votes 0 votes Show that if $a_{n} = a_{n-1} + a_{n-2}, a_{0} = s\:\text{and}\: a_{1} = t,$ where $s$ and $t$ are constants, then $a_{n} = sf_{n-1} + tf_{n}$ for all positive integers $n.$ Combinatory kenneth-rosen discrete-mathematics counting recurrence-relation descriptive + – admin asked May 6, 2020 admin 168 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.