LREtools
divconq
find solutions of "divide and conquer" recurrence equations
Calling Sequence
Parameters
Description
Examples
divconq(problem)
problem
-
problem statement or RESol
Solves divide and conquer recurrences, meaning those of the form , where R is either numeric or a name, m and n are integers, and where A and B are independent of k.
See the help page for LREtools[REcreate] for the definition of the format of a problem.
See Also
LREtools[REcreate]
RESol
rsolve
Download Help Document