Revision as of 11:14, 27 December 2022 edit Laurusnobilis (talk \| contribs) Extended confirmed users 819 edits →Abelian property and iteration sequences: the period makes sense only for {{math\|m>0}} ← Previous edit		Revision as of 16:34, 27 December 2022 edit undo Jochen Burghardt (talk \| contribs) Extended confirmed users 24,306 edits →Abelian property and iteration sequences: stating the condition onve is sufficient Next edit →
Line 45: For a given {{mvar\|x}} in {{mvar\|X}}, the [[sequence]] of values {{math\|''f''<sup>''n''</sup>(''x'')}} is called the '''[[orbit (dynamics)\|orbit]]''' of {{mvar\|x}}. If {{math\|1=''f'' <sup>''n''</sup> (''x'') = ''f'' <sup>''n''+''m''</sup> (''x'')}} for some integer {{math\|m>0}}, the orbit is called a '''periodic orbit'''. The smallest such value of {{~~math~~mvar\|m>0}} for a given {{mvar\|x}} is called the '''period of the orbit'''. The point {{mvar\|x}} itself is called a [[periodic point]]. The [[cycle detection]] problem in computer science is the [[algorithm]]ic problem of finding the first periodic point in an orbit, and the period of the orbit. ==Fixed points==

Iterated function: Difference between revisions