Integers dividing sum of its neighbours.
Source: IMOC 2021 N4
August 11, 2021
number theory
Problem Statement
There are positive integers, not necessarily distinct, that are arranged in a circle so that any positive integer divides the sum of its neighbours.
Show that if there is exactly one , then for any positive integer , there are at most copies
of .Proposed By- (usjl, adapted from 2014 Taiwan TST)