Find all primes of the form $3^n -1$ Regarding the question, the prime must be a natural number, so n>0. I used Mathematica to test for primes for n ranging from $1$ to $10^5$. All of them were not prime aside from $n=1$, which gives you $2$. I believe contradiction would be used for proving that there are no other primes of this form. I am just not sure where to go from there.
Thank you for your assistance.
 A: A little mistake when you say "for $n=0$ is gives you $2$", you want to say "for $n=1$.
Otherwise, notice that 
$$3^n-1=0\pmod 2$$
(it is always even since $3^n$ is always odd).
So $3^n-1$ can not be a prime once it is greater than $2$. Therefore, the only case acceptable if $3^n-1=2$, which is the case for $n=1$.
A: A good approach to problems of this form is to assume (1) that there are no primes of this sort other than the easy example, and (2) that there's a simple reason, like a single number that must divide all of them. To determine what this "simple reason" is, look at the first few examples: $2, 8, 26, 80, \ldots$. The one factor these all have in common is $2$. So it's reasonable to suppose that every example will be even; we just need to know why. But then the answer is evident: $3^n$ is a product of odd numbers, so it will always be odd. An odd number minus one is always even. And if $n > 1$, then $3^n$ will be greater than $3$, so $3^n - 1$ will always be an even number greater than two - and hence will not be prime.
