Let [unparseable or potentially dangerous latex formula] where [unparseable or potentially dangerous latex formula] is an odd prime, and let
[unparseable or potentially dangerous latex formula]
Prove that if [unparseable or potentially dangerous latex formula] for integers [unparseable or potentially dangerous latex formula] and [unparseable or potentially dangerous latex formula], then [unparseable or potentially dangerous latex formula] is divisible by [unparseable or potentially dangerous latex formula].