Codex Wiki OurBigBook logoOurBigBook.comSite Source code
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 itinerary
has 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.

Ancestors (12)

  1. I
  2. B
  3. 32A
  4. Paper 1
  5. Ii
  6. 2024
  7. Past exam of the mathematics course of the University of Cambridge
  8. Mathematics course of the University of Cambridge
  9. Course of the University of Cambridge
  10. University of Cambridge
  11. List of universities
  12. Home