For $1\leq a, a+1<b$ with $a,b\in\mathbb{N}$ let
- $f:=f(a,b):=\sum_{i=2}^{b-a}i,$
- $g:=g(a,b):=f(a,b)+a+b+1$
- $h:=h(a,b):=f(a,b)-(b-a-1)$
and consider the polynomial $$ p(t):=t^g-\left(\sum_{i=h}^f t^i\right). $$
I would like to show that the largest (in absolute value) root of $p(t)$ is smaller than the largest (in absolute value) root of the polynomial $$ q(t):=t^{a+b+1}-t^{a+b}-1. $$
We can factor out $t^h$, i.e. $$ p(t)=t^h\cdot\left(t^{g-h}-\sum_{i=1}^{b-a-1}t^i -1\right), $$ so $$ p(t)=0\Leftrightarrow t^h=0\quad\text{ or }\quad t^{g-h}-\sum_{i=1}^{b-a-1}t^i-1=0 $$
In this proof, we only need that $a,b\in\mathbb{Z}_{\geq 0}$ with $a<b$. We have $$p(t)=t^{\frac{(b-a-1)(b-a-2)}{2}}\left(t^{2b}-\sum_{k=0}^{b-a-1}\,t^k\right)\,.$$ Observe that each of the two polynomials $p(t)$ and $q(t)$ has a unique positive real root (using Descartes's Rule of Signs, or something similar---there are a multitude of ways to show this simple result).
Write $\alpha$ and $\beta$ for the positive real roots of $p(t)$ and $q(t)$, respectively. Using Rouché's Theorem, $\alpha$ and $\beta$ are roots of $p(t)$ and $q(t)$, respectively, with the largest moduli amongst all (real or complex) roots. (Rouché's Theorem is not necessary here; this result can be proven via the Triangle Inequality for complex numbers.)
If $b=a+1$, then clearly $\alpha=1$ and $\beta>1$ (because $q(1)<0$). From now on, suppose that $b>a+1$, which means $\alpha>1$ and $\beta>1$ (noting that $p(1)<0$ and $q(1)<0$).
Suppose contrary that $\alpha\geq \beta$. Since $\beta^{a+b}(\beta-1)=q(\beta)+1=1$, we obtain $$\alpha^{a+b}\left(\alpha-1\right)\geq \beta^{a+b}\left(\beta-1\right)=1\,.$$ Now, since $p(\alpha)=0$ and $\alpha\neq 0$, we get that $$\alpha^{2b}=\sum_{k=0}^{b-a-1}\,\alpha^k=\frac{\alpha^{b-a}-1}{\alpha-1}\,.$$ That is, $$1\leq \alpha^{a+b}(\alpha-1)=\frac{\alpha^{b-a}-1}{\alpha^{b-a}}<1\,,$$ which is a contradiction.