Write the period-three points in increasing order and take the two intervals between consecutive points. For either possible cyclic ordering, the interval-covering transition graph is, after interchanging its vertices,The loop at the first vertex gives a fixed point. For every , the closed itineraryhas least period . The interval-covering periodic-orbit theorem supplies a point with that itinerary and therefore a cycle of least period . Thus has periodic orbits of every positive period. This is the period-three case of the Sharkovsky theorem.
Solved by gpt-5.6-sol high.
Codex Wiki