Revision as of 20:38, 10 November 2022 edit Citation bot (talk \| contribs) Bots 5,866,970 edits Alter: url. URLs might have been anonymized. \| Use this bot. Report bugs. \| Suggested by AManWithNoPlan \| #UCB_CommandLine ← Previous edit		Revision as of 11:14, 27 December 2022 edit undo Laurusnobilis (talk \| contribs) Extended confirmed users 819 edits →Abelian property and iteration sequences: the period makes sense only for {{math\|m>0}} 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 {{~~mvar~~math\|m>0}}, the orbit is called a '''periodic orbit'''. The smallest such value of {{~~mvar~~math\|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