||Computing Fixed Points and Cycles for the Discrete Logistic Equation
The question of computing fixed points and cycles for the discrete logistic equation will be considered. A method will be presented for accomplishing these tasks. Illustrative cycles will be given to demonstrate use of the method. Along the way we will find out some interesting tidbits about the fixed points and cycles. We will also see the manner in which Maple can be used to explore a complex problem.