Prove the theorem.
If [unparseable or potentially dangerous latex formula] is a positive divisor of [unparseable or potentially dangerous latex formula], the number of elements of order [unparseable or potentially dangerous latex formula] in the cyclic group of order [unparseable or potentially dangerous latex formula] is [unparseable or potentially dangerous latex formula]