Why is $p$ necessarily greater than $r$ in this number theory problem? From 1998 St. Petersburg City Mathematical Olympiad, presented in Andreescu & Andrica NT: SEP:

Let $n$ be a positive integer. Show that any number greater than $n^4/16$ can be written in at most one way as the product of two of its divisors having difference not exceeding $n$.

The presented solution is this:

Suppose, on the contrary, that there exist $a > c \ge d > b$ with $a-b \le n$ and $ab=cd>n^4/16$. Put $p=a+b, q=a-b, r=c+d,s=c-d.$ Now $$p^2-q^2=4ab=4cd=r^2-s^2>n^4/4.$$ Thus $p^2-r^2=q^2-s^2 \le q^2 \le n^2.$ But $r^2>n^4/4$ (so $r>n^2/2$) and $p>r\dots$

There is more to the solution, but that is irrelevant to my question. Why is $p>r$? It seems that this should be obvious, the way that it is presented. I notice that $p > r \Leftrightarrow p^2-r^2 > 0$, but I cannot prove that this is true. Manipulating the chain inequality $a>c\ge d > b$ has also done nothing for me.

It is implicit in the problem that the divisors in question are positive, because if you allowed negative divisors then you could always get a second factorization by reversing the factors' signs. So I'll take $a,b,c,d$ to all be positive.
Now I'm going to try to simplify the problem by reducing it to the case where the product $ab=cd$ is $1$. To do that, just divide all four of $a,b,c,d$ by $\sqrt{ab}=\sqrt{cd}$. If I introduce new variables $x=\sqrt{\frac ab}$ and $y=\sqrt{\frac cd}$ then I have $x>y\geq\frac1y>\frac1x$. 
What I need to prove is that $p>r$, which is $a+b>c+d$, which is (after dividing by $\sqrt{ab}=\sqrt{cd}$) just $x+\frac1x>y+\frac1y$. Since $x$ and $y$ are both $\geq1$ (because they're positive and $\geq$ their reciprocals), it suffices to show that the function $f(x)=x+\frac1x$ is increasing for $x\geq 1$.
Fortunately, that's easy, by differentiating.  The derivative $f'(x)=1-\frac1{x^2}$ is clearly positive for all $x>1$.
