# A conjecture about the form of some prime numbers

Let $k$ be an odd number of the form $k=2p+1$ ,where $p$ denote any prime number, then it is true that for each number $k$ at least one of $6k-1$, $6k+1$ gives a prime number.

Can someone prove or disprove this statement?

-
If this were true, don't you think that finding big prime numbers would be a whole lot easier? –  nightcracker Sep 12 '11 at 16:40
@nightcracker,this question will be considered as rhetorical –  pedja Sep 12 '11 at 16:50

$p = 59 \implies k = 2p + 1 = 119$. Neither $6k+1 = 715$ nor $6k-1 = 713$ is prime. Some other counter examples are:
You got confused with your quantifiers, but if your conjecture is what I guess it is, then the first five counterexamples are $p=$ 59,83,89,103,109.