On the recursive sequence x_n+1 = \ c, x_n^px_n-1p \

From MaRDI portal
Publication:953877





This work studies the boundedness and global attractivity for the posivitive solutions of the difference equation \(x_{n+1}= \max\{c,{x^p_n\over x^p_{n-1}}\}\), \(n\in\mathbb{N}_0\) with \(p,c\in(0,+\infty)\). It is shown that: (a) there exist unbounded solutions whenever \(p\geq 4\); (b) all positive solutions are bounded when \(p\in(0, 4)\); (c) every positive solution is eventually equal to 1 when \(p\in(0, 4)\) and \(c\geq 1\); (d) all positive solutions converge to 1 whenever \(p,c\in(0,1)\).




Cited in
(90)








This page was built for publication: On the recursive sequence \(x_{n+1} = \max \left\{ c, \frac {x_n^p}{x_{n-1}^p} \right\}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953877)