Jump Return Problem on the Circle

ISEF · 2019 Mathematics

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 Mathematics · Entry MATH028T Affiliated fair in Chinese Taipei

Resources

Related projects

Closest projects by meaning, across every fair and year in the corpus.

Browse more like this

Source: Regeneron International Science and Engineering Fair

Save projects to your library

Sign in with Google to keep track of projects you find interesting, organized into folders. An account also raises your daily allowance for “Has this been done?”, and lets you create a key for the MCP server with a much higher limit than anonymous use. Browsing stays public.

Continue with Google