ملخص
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.
اللغة الأصلية | English |
---|---|
الصفحات (من إلى) | 342-352 |
عدد الصفحات | 11 |
دورية | Applied Mathematics and Computation |
مستوى الصوت | 180 |
رقم الإصدار | 1 |
المعرِّفات الرقمية للأشياء | |
حالة النشر | Published - سبتمبر 1 2006 |
منشور خارجيًا | نعم |
ASJC Scopus subject areas
- ???subjectarea.asjc.2600.2605???
- ???subjectarea.asjc.2600.2604???