LREtools - Maple Programming Help

Home : Support : Online Help : Mathematics : Factorization and Solving Equations : LREtools : LREtools/REcontent

LREtools

 REcontent
 content of a recurrence operator
 REprimpart
 primpart of a recurrence operator

 Calling Sequence REcontent(problem) REprimpart(problem)

Parameters

 problem - problem

Description

 • REcontent returns the content of the shift operator (that is, INFO[shifteqn]), thus returning the greatest common divisor of the coefficients of the operator.
 • Similarly, REprimpart returns INFO[shifteqn]/REcontent(problem). Note:  Whereas the sign is removed from the content, it is not removed from the primitive part.

Examples

 > $\mathrm{with}\left(\mathrm{LREtools}\right):$
 > $\mathrm{REcontent}\left(\left(n+1\right)u\left(n+2\right)+\left(n+1\right)u\left(n\right),u\left(n\right),\left\{\right\}\right)$
 ${n}{+}{1}$ (1)
 > $\mathrm{REprimpart}\left(\left(n+1\right)u\left(n+2\right)+\left(n+1\right)u\left(n\right),u\left(n\right),\left\{\right\}\right)$
 ${{\mathrm{&Shift}}{[}{n}{]}{}\left({u}\right)}^{{2}}{+}{1}$ (2)
 > $\mathrm{REcontent}\left(\left(n+1\right)u\left(n+2\right)+\left(n+2\right)u\left(n\right),u\left(n\right),\left\{\right\}\right)$
 ${1}$ (3)
 > $\mathrm{REprimpart}\left(\left(n+1\right)u\left(n+2\right)+\left(n+2\right)u\left(n\right),u\left(n\right),\left\{\right\}\right)$
 ${{\mathrm{&Shift}}{[}{n}{]}{}\left({u}\right)}^{{2}}{}{n}{+}{{\mathrm{&Shift}}{[}{n}{]}{}\left({u}\right)}^{{2}}{+}{n}{+}{2}$ (4)