I have $x - y = z$ where $z$ is known and I have arbitrary bounds on $x$ and $y$ (lowest and highest possible value for each).
Is there a way, without resorting to brute force, to determine how many possible ways $x-y$ can equal $z$ given the bounds of $x$ and $y$ and known $z$?