Proof by contadiction.
Let assume there exist such positive integers [tex]a[/tex] and [tex]b[/tex] whose sum is a prime number [tex]p[/tex], that their greatest common divisor is greater than 1.
[tex] a,b\in\mathbb{Z^+}\\d=\text{gcd}(a,b)>1\\\\a=de\\b=df\\e,f\in\mathbb{Z^+}\\\\a+b=p\\de+df=p\\d(e+f)=p\\ [/tex]
Since [tex] p [/tex] is a prime number and [tex] d>1 [/tex], then [tex] d=p \wedge e+f=1 [/tex], but we assumed earlier that [tex] e,f\in\mathbb{Z^+} [/tex], and there are no two positive integers that sum up to 1.
q.e.d.