Jump Return Problem on the Circle
Overview
In this study, we consider a discrete dynamic system starting with n arbitrary points on a circle. In one transition, each point moves simultaneously from its current state counterclockwise to the ratio p:q division point of the arc in front of it. We are concerned with all possible numbers of transitions needed for at least one point returns to its initial position. As a consequence, depending on the ratio p/q, we give a formula for all of the number of transitions needed to satisfy the criterion. Also, we conclude that there always exists a sub-process in which the n points approach to a limiting steady state of n components having the amazing property to subdivide the circle evenly.
Awards (1)
- American Mathematical Society: Third Award of $500 $500
Competition history
- ISEF 2019
Resources
Related projects
ISEF · 2021
Period-3 Point of Generalized Tent Mapping: Orbit Type and Stability Analysis
ISEF · 2022
A Circular Approach to the Broken Pick-Up Sticks Problem
ISEF · 2026
Digraphs From a New Josephus Transformation
ISEF · 2017
Generalized Problem of Apollonius
ISEF · 2025
Revisiting the Collatz Conjecture: Analysing Strings, Discovering Bounds, and Computing Distributions in Binary Collatz Orbits
ISEF · 2026
The Repelling Propellers Problem: Optimizing Energy Configurations in Orbital Patterns
ISEF · 2025
Exploration of the Ninja Path
ISEF · 2017
The Iterations of Tent Maps
Closest projects by meaning, across every fair and year in the corpus.
Browse more like this
Source: Regeneron International Science and Engineering Fair