Can we post solutions if no one has answered it?
Suppose to each vertex of a pentagon, we assign a number with . If are numbers assigned to three successive vertices and if , then replace with . Repeat this as long as . Does this algorithm always stop? If it does stop, how many steps are needed? If not, why doesn't it stop? Prove that it stops or does not stop.