Let $a, b$ be relatively prime integers and let $p$ be a prime number.
Suppose that we have
\[a^{2^n}+b^{2^n}\equiv 0 \pmod{p}\]
for some positive integer $n$.

Since $a$ and $b$ are relatively prime, at least one of them is relatively prime to $p$.
Without loss of generality let us assume that $b$ and $p$ are relatively prime.

Then the given equality becomes
\begin{align*}
a^{2^n}\equiv -b^{2^n} \pmod{p} \\
\iff \left( \frac{a}{b}\right)^{2^n} \equiv -1 \pmod{p}.
\end{align*}
Taking square of both sides we obtain
\[\left( \frac{a}{b}\right)^{2^{n+1}} \equiv 1 \pmod{p}.\]

Now, we can think of these congruences as equalities of elements in the multiplicative group $(\Z/p\Z)^{\times}$ of order $p-1$:
\[ \left( \frac{a}{b}\right)^{2^n} = -1 \text{ and } \left( \frac{a}{b}\right)^{2^{n+1}} =1 \text{ in } (\Z/p\Z)^{\times}.\]

Note that the second equality yields that the order of the element $a/b$ divides $2^{n+1}$.
On the other hand, the first equality implies that any smaller power of $2$ is not the order of $a/b$.
Thus, the order of the element $a/b$ is exactly $2^{n+1}$.

In general, the order of each element divides the order of the group.
(This is a consequence of Lagrange’s theorem.)

Since the order of the group $(\Z/p\Z)^{\times}$ is $p-1$, it follows that $2^{n+1}$ divides $p-1$.
This completes the proof.

Use Lagrange’s Theorem to Prove Fermat’s Little Theorem
Use Lagrange's Theorem in the multiplicative group $(\Zmod{p})^{\times}$ to prove Fermat's Little Theorem: if $p$ is a prime number then $a^p \equiv a \pmod p$ for all $a \in \Z$.
Before the proof, let us recall Lagrange's Theorem.
Lagrange's Theorem
If $G$ is a […]

A One-Line Proof that there are Infinitely Many Prime Numbers
Prove that there are infinitely many prime numbers in ONE-LINE.
Background
There are several proofs of the fact that there are infinitely many prime numbers.
Proofs by Euclid and Euler are very popular.
In this post, I would like to introduce an elegant one-line […]

Find the Largest Prime Number Less than One Million.
Find the largest prime number less than one million.
What is a prime number?
A natural number is called a "prime number" if it is only divisible by $1$ and itself.
For example, $2, 3, 5, 7$ are prime numbers, although the numbers $4,6,9$ are not.
The prime numbers have always […]

Mathematics About the Number 2017 Happy New Year 2017!!
Here is the list of mathematical facts about the number 2017 that you can brag about to your friends or family as a math geek.
2017 is a prime number
Of course, I start with the fact that the number 2017 is a prime number.
The previous prime year was […]

A Subgroup of the Smallest Prime Divisor Index of a Group is Normal
Let $G$ be a finite group of order $n$ and suppose that $p$ is the smallest prime number dividing $n$.
Then prove that any subgroup of index $p$ is a normal subgroup of $G$.
Hint.
Consider the action of the group $G$ on the left cosets $G/H$ by left […]

The Group of Rational Numbers is Not Finitely Generated
(a) Prove that the additive group $\Q=(\Q, +)$ of rational numbers is not finitely generated.
(b) Prove that the multiplicative group $\Q^*=(\Q\setminus\{0\}, \times)$ of nonzero rational numbers is not finitely generated.
Proof.
(a) Prove that the additive […]

The Order of $ab$ and $ba$ in a Group are the Same
Let $G$ be a finite group. Let $a, b$ be elements of $G$.
Prove that the order of $ab$ is equal to the order of $ba$.
(Of course do not assume that $G$ is an abelian group.)
Proof.
Let $n$ and $m$ be the order of $ab$ and $ba$, respectively. That is,
\[(ab)^n=e, […]

The Product Distinct Sylow $p$-Subgroups Can Never be a Subgroup
Let $G$ a finite group and let $H$ and $K$ be two distinct Sylow $p$-group, where $p$ is a prime number dividing the order $|G|$ of $G$.
Prove that the product $HK$ can never be a subgroup of the group $G$.
Hint.
Use the following fact.
If $H$ and $K$ […]