|
LREtools[divconq] - find solutions of "divide and conquer" recurrence equations
|
|
Calling Sequence
|
|
divconq(problem)
|
|
|
Parameters
|
|
|
problem
|
-
|
problem statement or RESol
|
|
|
|
|
|
Description
|
|
|
•
|
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.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
| (2) |
|
>
|
|
|
| (3) |
|
|
Download Help Document
Was this information helpful?
