find solutions of "divide and conquer" recurrence equations
problem statement or RESol
Solves divide and conquer recurrences, meaning those of the form A⁢f⁡Rn⁢k+B⁢f⁡Rm⁢k=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.
prob ≔ REcreate⁡y⁡n⁢k=2⁢y⁡k,y⁡k,
prob ≔ RESol⁡y⁡n⁢k−2⁢y⁡k=0,y⁡k,,INFO
Download Help Document
What kind of issue would you like to report? (Optional)
Thank you for submitting feedback on this help document. Your feedback will be used
to improve Maple's help in the future.