Solve : $\frac{n}{2}(n+1)=2014+2k$. $n,k$ are positive integers and $n>k$, solve the equation : $$\frac{n(n+1)}{2}=2014+2k.$$

the first thing I did is to write the LHS as $(2n+1)^2$ but I face an equation like $ak+b=m^2$, I know it has infinitely many solution, I know how to deal with this kind of equation if the LHS in the latter one is a second degree polynomial (doing some factorization), but I can't do the same in this case, Can you show me to do it ?
 A: $\dfrac{n(n+1)-4028}{2}=2k \implies n(n+1)-4028=4k \implies 4 |n$ or $n+1$.
$n>k$, for what values do you get positive values for this expression:$n(n+1)-4028$ ?
$n(n+1)-4028 >0 \implies n(n+1)>4028$ . When is this attainable? $\sqrt{4028} \approx63$
We can take $63(64)-4028=4k$ and $65(64)-4028=4k$ 
Now you have a constrain $n>k$. What happens when $n=67$? $k=132$ , it is not allowed. Therefore, you can conclude only two pairs of solutions: $(n,k)=(63,1)$ and $(64,33)$. 
A: We have $4028=n(n+1)-4k$
As we need $n>k, -k>-n$
$ n(n+1)-4k>n(n+1)-4n=n^2-3n$
$\implies n^2-3n<4028$
the roots of $n^2-3n-4028=0$ are $\frac{3\pm\sqrt{3^2-4\cdot1\cdot(4028)}}2=\frac{3\pm\sqrt{16221}}2$
$\implies 0<n<\approx 64.98$
As Inceptio has identified $n\ge 63, n=63, 64$
A: Well you can rewrite the equation as:
$n^2+n-4(1007+k)=0$
You solve this equation the usual way and you get your condition on $k$:
$\Delta=1+16(1007+k)$
Now, $(\Delta=0)\Leftrightarrow(k=-(1007+\frac{1}{16})=k_0)$ and ($\Delta>0)\Leftrightarrow(k>k_0)$
In the first case, your resulting $n$ would be: $n=-\frac{1}{2}$ which is not in $\mathbb{N}$ so not a solution.
In the second case you have two possible solutions:
$\cases{n_1=\frac{-1-\sqrt{\Delta}}{2}=\frac{-1-\sqrt{1+16(1007+k)}}{2} \\ n_2=\frac{-1+\sqrt{\Delta}}{2}=\frac{-1+\sqrt{1+16(1007+k)}}{2}}$
For those to be in $\mathbb{N}$, the numerator needs to be a multiple of $2$ (and an integer of course).
Now you just have to find all the $k>k_0$ for which $n_1$ and/or $n_2$ is in $\mathbb{N}$.
A: If your equation is multiplied by $8$ and $1$ added to both sides you get 
$$(2n+1)^2=16k+16113.$$
An odd square is $1$ mod 8, and so is $16113$, so things look good. Then as noted by Inceptio only half of these actually work, giving $n=0,3$ mod $8$. So we can start with any such $n$ and just compute
$$k=\frac{(2n+1)^2-16113}{16}.$$
(If you use an $n=1,2$ mod 4 what happens is this formula gives a half integer for $k$.)
