Not Every Number is the Sum or Difference of Two Prime Powers

Theorem
Not every positive integer can be expressed in the form $p^m \pm q^n$ where $p, q$ are prime and $m, n$ are positive integers.

Proof
What is to be demonstrated is that there exist odd integers which cannot be expressed as $2^m \pm q^n$.