If two numbers be prime to one another, the sum will also be prime to each of them; and if the sum of two numbers be prime to either of them, the original numbers will also be prime to one another.
Proof
Any common divisor of a+b and a would also divide b (by
Common Notion 3), contradicting gcd(a,b)=1. Converse runs the
same way.