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 AfRnk+BfRmk=0, 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.
withLREtools:
prob≔REcreateynk=2yk,yk,∅
prob≔RESolynk−2yk=0,yk,∅,INFO
divconqprob
y1kln2lnn~
divconqfr3k=2fr2k,fk,∅
f1kln2lnr
See Also
LREtools[REcreate]
RESol
rsolve
Download Help Document