0 votes 0 votes Find all solutions of the recurrence relation $a_{n} = 2a_{n-1} + 3n.$ Find the solution of the recurrence relation in part $(A)$ with initial condition $a_{1} = 5.$ Combinatory kenneth-rosen discrete-mathematics counting recurrence-relation descriptive + – admin asked May 5, 2020 admin 304 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.