Problem

Source:

Tags: modular arithmetic, quadratics



Suppose $p$ is a prime with $p \equiv 3 \; \pmod{4}$. Show that for any set of $p-1$ consecutive integers, the set cannot be divided two subsets so that the product of the members of the one set is equal to the product of the members of the other set.