Y by
Let
be a prime number. We construct a directed graph of
vertices, labeled with integers from
to
. There is an edge from vertex
to vertex
if and only if
. Let
denotes the length of the longest directed cycle in this graph. Prove that
can attain arbitrarily large values.









This post has been edited 1 time. Last edited by mathuz, Dec 28, 2023, 8:09 AM