I want to use Fermat's Little Theorem to deduce that

$\displaystyle 13^{16n+2} + 1$

is divisible by 7, where n is a positive integer.

Does this have anything to do with modular arithmetic? D:

If so, would I set it up like $\displaystyle 13^{16n+2} \equiv 1 (mod 7)$