Is the sum of two unique primes always unique? I.e is it an injective function on integers? For example, $89 + 2 = 91$ and there's no other sum of two different primes that's equal to $91$.
It's been a long time since I did a proper proof but I checked it programmatically for the first $10^4$ primes and it seems to hold true. How can I prove that though?
PS: This was true by definition if it was multiplication, but I don't see the connection from the definition to addition.
On the back of an envelope, so to speak, I get
\begin{array}{|r|r|r|r|r|r|r|r|r} & 3 & 5 & 7 & 11 & 13 & 17 & 19 & 23 & 29 \\ \hline 2 & 5 & 7 & 9 & 13 & 15 & 19 & 21 & 25 & 31 \\ 3 & & 8 & 10 & 14 & 16 & 20 & 22 & 26 & 32 \\ 5 & & & 12 & 16 & 18 & 22 & 24 & 28 & 34 \\ 7 & & & & 18 & 20 & 24 & 26 & 30 & 36 \\ 11 & & & & & 24 & 28 & 30 & 34 & 40 \\ 13 & & & & & & 30 & 32 & 36 & 42 \\ 17 & & & & & & & 36 & 40 & 46 \\ 19 & & & & & & & & 42 & 48 \\ 23 & & & & & & & & & 52 \\ \end{array}
So, the odd numbers seem to be unique. By contrast, the even numbers show a lot of repetition: 16 appears twice in the table above, and so do 18, 20 and 22. And 24 appears thrice, as does 30. With just one more column, 36 would appear four times.
Before giving a proper proof of the apparent uniqueness of the even numbers in the table above, we need to agree on our definitions.
If $n$ is an odd number and there exist distinct positive primes $p$ and $q$ such that $p + q = n$, then that pair of primes is the only pair of primes with that sum. Either $p = 2$ or $q = 2$.
Um... you know, as I write that, a formal proof feels like overkill to me.