For a given $n$, consider the assertion:
$\exists a \in \Bbb Z : a^n-(a-1)^n\ \text{is prime}\tag*{}$
How can one do one of the following:
- Prove that the assertion is true for all integer $n > 1$
- Prove that the assertion is false for all integer $n > 1$
- Characterize the values of $n > 1$ for which the assertion is true
The assertion is clearly true (with $a=2$) for all values of $n$ that are Mersenne prime exponents. Also, we only need to consider positive values for $a$. If $a<0$ then $a^n-(a-1)^n$ is negative (and hence not prime) when $n$ is even and is equal to $(1-a)^n-((1-a)-1)^n$ when $n$ is odd.
I suspect the assertion is true for all $n > 1$, but I have no idea how to prove it.
EDIT (thanks to @Malcolm):
The assertion is false whenever $n$ is composite. This is because $a^{uv} - (a-1)^{uv}$ is divisible by $a^u - (a-1)^u$ and by $a^v - (a-1)^v$. (This can be shown by induction on $v$ for $a^u - (a-1)^u$ and vice versa.)
I'd still like to know if the assertion is true for $n$ prime and not a Mersenne prime exponent.
EDIT 2:
It turns out that this family of numbers has been studied before, although not extensively, as one form of generalized Mersenne numbers. (See, for instance, the 2003 conference paper Generalized Mersenne prime numbers: characterization and distributions by Vladimir Pletser.) It also turns out that there are indeed primes of the form $a^n - (a-1)^n$ for values of $n$ that are not Mersenne prime exponents. For instance,
$M_{11} = 2^{11} - 1 = 2047 = 23\cdot89\tag*{}$
while
$6^{11} - 5^{11} = 313968931\tag*{}$
is prime. Pletser established by brute force that there are primes of the form $a^n - (a-1)^n$ for all prime $n$ through 31. He and T. D. Noe have tabulated the smallest such prime for the first 80 primes. See OEIS A121620.