Find all integers n > 1 so that n, n + 2, n + 4 are all prime Find all integers n > 1 so that n, n + 2, n + 4 are all prime.

Have no idea what to do, anyone know how to solve this one?
Hint : One of the three numbers is divisible by $3$.
The two first must be twin numbers. For the rest I had a lapse. Sorry. 

The question is then Find all the triples of consecutive primes such that the two first ones and the two last ones are both twin numbers.

The integer $n$ can be equal to $3m, 3m+1, 3m+2$. Taking these three only possibilities we see clearly that of $n,n+2,n+4$ one of them is necessarily divisible by 3.Hence the only solution $(3,5,7)$. This is a very easy problem indeed.