MathDB
O 46

Source:

May 25, 2007
modular arithmeticquadratics

Problem Statement

Suppose pp is a prime with p≡3  (mod4)p \equiv 3 \; \pmod{4}. Show that for any set of p−1p-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.
Back to ProblemsView on AoPS