In this paper, we investigate dynamical systems which are given by f : x 7→ x2 + c modulo a prime and for which value of the constant c can we get the largest possible cycle. We get the main ideas for finding cycles in iteration functions by introducing Floyd’s algorithm. Next, we implement the algorithms and ideas for finding cycles in Mathematica and visualize the results. In addition, we study the theoretical bounds for the length of the largest cycle and the case of c = 0 in detail. At last, we have some short discussion to this effect.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:lnu-68047 |
| Date | January 2017 |
| Creators | ZHOU, YURU |
| Publisher | Linnéuniversitetet, Institutionen för matematik (MA) |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0018 seconds