Prove that there are infinitely many twin primes if and only if there are infinitely many integers that cannot be written in any of the following forms: \[6uv+u+v, \;\; 6uv+u-v, \;\; 6uv-u+v, \;\; 6uv-u-v,\] for some positive integers $u$ and $v$.
Problem
Source:
Tags:
maxal
25.05.2007 03:24
Note that twin primes have form $6k\pm 1.$ If $6k+1$ is not prime then there exist integers $u$ and $v$ such that $6k+1=(6u+1)(6v+1)$ or $6k+1=(6u-1)(6v-1),$ implying that $k=6uv+u+v$ or $k=6uv-u-v.$ Similarly, if $6k-1$ is not prime then there exist integers $u$ and $v$ such that $6k+1=(6u+1)(6v-1)$, implying that $k=6uv-u+v.$ Therefore, if $k$ cannot be written in any of these forms then both $6k-1$ and $6k+1$ are primes.
Peter
15.12.2007 00:01
That's only half of the question, no?
ZetaX
15.12.2007 00:15
Change all if's into iff's