This is a problem in diophantine equations- a and b must be integer so that, while a single equation in two variables has an infinite number of solutions, it is possible to write a formula for them.
Here, you are saying that a+ 11b= 13x for some integers a, b, and x, and that a+ 13b= 11y for some integer y.
We can subtract one equation from another to bet 2b= 11y- 13x. Now, 11 divides into 13 once with remainder 2: 13- 11= 2. So one solution, for b= 1, is x=-1, y= -1. But if we take x=-1+ 11k, y= -1+ 13k, then 11y- 13k= 11(-1+ 13k)- 13(-1+ 11k)= -11+ 11(13)k+ 13- 13(11)k= 2 for all k. And since x= -1+ 11k, y= -1+ 13k is the "general solution" for b= 1, x= -b+ 11k, y= -b+ 13k (technically, it should be "-b+ 11kb" but I has absorbed the b into the integer k) is the general solution for any b.
Now go back to a= 11y- 13b= 11(-b+ 13k)- 13b= -24b+ 143k. We have a+ b= -23b+ 143k. Since a and b are both postive, a+ b must be postive:-23b+ 143k> 0 or 143k> 23b.