in Combinatory
292 views
0 votes
0 votes
  1. Find all solutions of the recurrence relation $a_{n} = 2a_{n-1} + 3n.$
  2. Find the solution of the recurrence relation in part $(A)$ with initial condition $a_{1} = 5.$
     
in Combinatory
by
292 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true