Question: Analyzing and plotting recursion equations in Maple 12

I want to learn how to analytically and graphically analyze discrete time recursion equations such as the following: N(t+1) = (1+b)(1-d)N(t) in Maple 12 because Mathematica decided to crap out on me right before I have to give a professional talk (SHAME ON YOU STEPHEN WOLFRAM!!). Does anybody have a good direction to point me in? Basically, in Mathematica, what I would do is: N[t_, b_, d_]:=N[t,b,d]=(1+b)(1-d)N[t-1,b,d] I would especially appreciate it if someone could point me in the direction of some website or book where Maple 12 is applied to biomathematical problems like replicator dynamics and inbreeding coefficient dynamics. Thank you for your help. I really really need it.
Please Wait...