When working on a problem on Project Euler I came up with a formula I need to solve:
$N(N-1) = 2X(X-1)$ for $N > 10^{12}, X > 0$
with $N$ and $X$ being integer numbers.
After some investigation I came to the conclusion that this kind of problems is well known in mathematics, and that my equation is a so called Diophantine Equation.
Any pointers on how to proceed to solve this problem? I've read about Pell's Equation, but it doesn't seem to be a good fit for the aforementioned equation.
Thanks