The square of the Fermat quotient.
We assign to each pair of positive integers and a digraph whose set of vertices is and for which there is a directed edge from to if . We investigate the structure of . In particular, upper bounds are given for the longest cycle in . We find subdigraphs of , called fundamental constituents of , for which all trees attached to cycle vertices are isomorphic.