Lemma 0.1. For positive integers a and b if a > b, then a - b.

Proof. We prove by contradiction. Suppose a > b and a | b. It follows that there

is a positive integer k such that b = ak. Since k ≥ 1 and a ≥ 1, multiplying both
sides of the first inequality by a, we obtain ak ≥ a. Therefore, since b = ak, it
follows that b ≥ a, which is a contradiction.
Lemma 0.2. For a and n positive integers such that a > 1

a - n or a - (n + 1).

Proof. We prove by contradiction. Suppose that

a | n and a | (n + 1).

It follows that there are positive integers k and l such that

n = ak and n + 1 = al.

Subtracting the first equation from the second we obtain

1 = a(l − k),

which means that a | 1. However, since a > 1, it follows from Lemma 0.1 that
a - 1, which is a contradiction.