MathDB

<span class='latex-bold'>Problem 5+.</span>

There is a

2020-

regular agon its vertices are numbered with

2020

consecutive natural numbers. Cobyi wants to travel moving from vertex to vertex (forming a single line) with the following conditions:

(a)

Start at the vertex with the smallest number.

(b)

When making the firts movement, the other movements dependent on the sum of the indices through which Cobyi has alrready passed.

(c)

if the sum of the indices exceeds the largest number listed in the vertices, the vertices change index with the smallest number equal to

1

, consequently Cobyi goes to number

1

and the process repeats.
Determine the smallest and longest distance Cobyi can travel
Proposed by David Cruz, Francisco Morazan

Problem Statement