Question: mathematical induction

Hi everyone,  to have an example, the following recurrence is given. I want to proof that it converges (and determine the limit for n->infinity).


Maple cannot find an explicit  form of a(n), typing rsolve(g,a(n)); gives the input back. One standard approach would be calculating the possible limit by solving the fixed point equation


this isn't a problem ofc. Further it is necessary to show a(n) is bounded and grows monotonous. So my question is, is Maple a useful tool for mathematical induction ?

Can Maple do the inductive step to show that a(n+1)>a(n) ?













Please Wait...