A new proof of a theorem of Mansour and Sun (Q942127)

The theorem mentioned in the title says [\textit{T. Mansour} and \textit{Y. Sun}, Eur. J. Comb. 29, No. 5, 1200-1206 (2008; Zbl 1178.05007)]: Let \(m,p,k\geq 1\) and \(n\geq mpk+1\). Then the number of \(k\)-subsets \(\{x_1,\dots,x_k\}\) of \({\mathbb Z}_n\) such that \(| x_i-x_j| \notin \{m,2m,\dots,pm\}\) for all \(1\leq i<j\leq k\) is given by \({n-pk\choose k} n/(n-pk)\). The original proof was based on computation of the residues of a Laurent series, the proof in the paper under review is combinatorial and uses elementary number theory and repeated use of the so-called Rothe's identity.