- #1

- 73

- 0

## Homework Statement

Let n and k be integers with n>=2 and k>=2. Prove that (n-1)|(n^k - 1).

Hence prove that if n^k - 1 is prime then n=2 and k is prime.

## Homework Equations

## The Attempt at a Solution

I think you go about this question by using proof by induction. However im really not sure how to do this. Any help would be great! Thanks