# Lattice points on a line y = -x + p visible from the origin

Given a lattice point grid, for a line y = -x + p, where p is a prime, why is it true that each point on the line is visible from the origin? Another way of representing this problem is to ask why the gcd(p - n, n) = 1 for some prime p and integer n? Through my research, I know that the totient function will say how many points there will be on the line, but I don't see how to show that these coordinates have to be relatively prime, and thus visible from the origin.

Edit: I meant to include that the x and y intercepts on the line are not to be included in this. Also, I did not realize that two numbers that sum to a prime must be coprime, I believe that is what I needed, thanks!

It is not true. $(p,0)$ is on the line, which is hidden by $(1,0)$. So is $(2p,-p)$ which is hidden by $(2,-1)$
• I gave two specific examples. Do you claim either one is not on the line $y=p-x$? Do you dispute the hiding points I cited? Both have common factors of $p$. The statement that two numbers that sum to a prime are coprime is true in the naturals, but $-4+6=2$ and $-4$ and $6$ are not coprime. – Ross Millikan May 9 '17 at 5:03