0

Prove that there are infinitely many pairs $(k,N)$ of positive integers such that $1+2+\cdots+k = (k+1)+(k+2)+\cdots+N$.

I thought of transforming this into a Pell equation, but I didn't see a way of doing that. Should we show that if the equation is true for some $(k,N)$ it is also true for another?

user19405892
  • 15,592

2 Answers2

0

Obviously, because the solution respect to, for example to $k$ is: $$k=N-\dfrac{1}{2}+\dfrac{1}{2}\sqrt{(8N^2+1)},$$ excluding the negative ones, you can get infinite solutions. Given $N$ you can get $k$

0

$$1+2+\cdots+k = (k+1)+(k+2)+\cdots+N$$ you can find the sums of two sides and you will get a second degree equation solve it and you get: $$k=\frac{-1}{2}+\frac{1}{2}\sqrt{2N^2+2N+1}$$

use this "Maple" instructions you get the solution:

$f:=k->\sum_{i=0}^{k}i-\sum_{j=k+1}^{N}j$:

$solve\left(f(k)=0,k\right)$;

TH3
  • 21