Skip to content
← All questions

What is the definition of least or prime period?

A point has least or prime period mm if it returns to itself after mm iterations and does not return earlier at any smaller positive iterate. This excludes trivial cases where a point already repeats with a smaller period.

Conditions

  • mm is a positive integer.
  • kk ranges over integers with 1≤k<m1\le k<m.
  • pp is a periodic point of ff.

Reasoning, step by step

  1. Check if the mm-th iterate returns to pp: fm(p)=pf^m(p)=p.
  2. Check if any smaller positive iterate kk (where 1≤k<m1\le k<m) returns to pp.
  3. If fk(p)≠pf^k(p)\neq p for all 1≤k<m1\le k<m, and fm(p)=pf^m(p)=p, then mm is the least period.
  4. Conclude that mm is the smallest positive number of iterations needed for the point to come back to itself.

Example

Finally, the board gives the formal condition: pp has least (prime) period mm if fm(p)=pf^m(p)=p and for every integer kk with 1≤k<m1\le k<m, one has fk(p)≠pf^k(p)\neq p. In words, mm is the smallest positive number of iterations needed for the point to come back to itself.

Common misconceptions

  • Forgetting to check the condition fk(p)≠pf^k(p)\neq p for all 1≤k<m1\le k<m.
  • Assuming that mm can be zero or negative.

Watch the explanation

Connected concepts

Explore next

Related questions

Meet the concept

↗
Understand why

↗
Meet the concept

↗
Find a method

↗

Answers are generated from source material and independently checked. Consult the original video or creator if something is unclear.