# For any $x\in \mathbb{N}$ does there exist $m\in \mathbb{N}$ such that $2x+1+2m, 2x+1+4m$ are both prime?

Could someone please give me a proof (or counter example) for this (I believe it is true):

For any $x$ (Whole Number) there exists some $m$ (Also Whole) such that $2x+1+2m$ and $2x+1+4m$ are both prime.

An equivalent is for any odd $n$ there exists some even $y$ such that $n+y$ and $n+2y$ are both prime. I am pretty sure a proof would be based around Dirichlet's Theorem.

• @ritwiksinha Depends on your definition of $\Bbb N$. It is in no way established convention that $0\notin \Bbb N$. Commented Jul 9, 2016 at 17:04
• An equivalent question is: for any odd $n$, does there exist a solution to the linear equation $2y-z=n$ where both $y$ and $z$ are prime. This is probably as hard as the Goldach conjecture (which asserts that for any even $n$, there exists a solution to the linear equation $y+z=n$ where both $y$ and $z$ are prime). Commented Jul 9, 2016 at 17:08
• Green Tao theorem implies that there are infinitely many prime numbers $n$ such that there is even $y$ with $n$, $n+y$, and $n+2y$ are all primes. Commented Jul 9, 2016 at 17:08
• The conjecture is true for $1\le n\le 2,166,701$ and an $y\le 1,986$ always exists in this range. Commented Jul 9, 2016 at 20:37
• The conjecture is true for $1\le n\le 6,374,879$ and in this range, an $y\le 2,190$ doing the job always exists. Commented Jul 9, 2016 at 21:27