Prove that there are infinitely many pairs $(k,N)$ of positive integers such that $1+2+\cdots+k = (k+1)+(k+2)+\cdots+N$.
The solution says "it's easy to check that $(k,N)$ solution $\implies$ $(3k+2N+2,4k+3N+3)$ solution too". How do we verify that? So far I found $$1+2+\cdots+k = \dfrac{k(k+1)}{2}= (k+1)+(k+2)+\cdots+N = \dfrac{(N-k)(N+k+1)}{2}$$ and $$1+2+\cdots+(3k+2N+2) = \dfrac{(3k+2N+3)(3k+2N+2)}{2}= (3k+2N+3)+(3k+2N+4)+\cdots+(4k+3N+3) =\dfrac{(7k+5N+6)(N+k+1)}{2}.$$ Is there an easier way?