On the periodic logistic equation

摘要

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.