Question 44
Is it possible to write $\binom{n}{2}$ consecutive natural numbers on the edges of a complete graph with $n$ vertices such that for every path (or cycle) of length $3$ with edges $a, b, c$ ($b$ lies between $a, c$) the greatest common divisor of the numbers of edges $a$ and $c$ divides the number of edge $b$?