Abstract
We show that the p-periodic logistic equation xn+1 = μn mod pxn(1 - xn) has cycles (periodic solutions) of minimal periods 1, p, 2p, 3p, ... Then we extend Singer's theorem to periodic difference equations, and use it to show the p-periodic logistic equation has at most p stable cycles. Also, we present computational methods investigating the stable cycles in case p = 2 and 3.
Original language | English |
---|---|
Pages (from-to) | 342-352 |
Number of pages | 11 |
Journal | Applied Mathematics and Computation |
Volume | 180 |
Issue number | 1 |
DOIs | |
Publication status | Published - Sept 1 2006 |
Keywords
- Attractors
- Logistic map
- Non-autonomous
- Periodic solutions
- Singer's theorem
ASJC Scopus subject areas
- Computational Mathematics
- Applied Mathematics