My task is to find all integers $n$ such that $\frac{(n^2-n-1)^2}{2n-1}$ is a positive integer, and if possible a general technique for solving questions of this type of rational functions. My first step in finding solutions was I showed that both numerator and denominator must be odd (using modular arithmetic base $2$) and thus if $d(2n-1)=(n^2-n-1)^2$, then $d$ must be odd. First considering the case of $2n-1$ equaling $n^2-n-1$ and thus $n$ must equal $0$ or $3$ (so two solutions). Next considering $2n-1$ equaling $(n^2-n-1)^2$ and the only integer solution to this is $n=1$ (third solution). I've now stumbled on how to check for further solutions, and am seeking hints/methods/solutions to finding the other potential solutions. Thank you.

  • $\begingroup$ If $n\le 0$, then the fraction is negative, so not a positive integer. That eliminates half of possible $n$ for you. :-) $\endgroup$
    – vadim123
    Mar 22, 2018 at 22:43
  • $\begingroup$ If $p|(n^2-n-1)$ and $p|(2n-1)$ then $p|(n^2+n)$. If also $p$ does not divide $n$ then $p|(3n)$ so $p|3$ ??? $\endgroup$
    – Malcolm
    Mar 22, 2018 at 22:52

2 Answers 2


Mimicking this lovely answer, we compute the extended Euclidean GCD to find $$25=16(n^2-n-1)^2+(-8n^3+12n^2+14n-9)(2n-1)$$

Hence, if $2n-1$ divides $(n^2-n-1)^2$, then it also divides $25$. We test each solution to $2n-1\in\{\pm 1, \pm 5\pm 25\}$.


Let $k=2n-1$ then $$2n\equiv_k 1$$ and $$(n^2-n-1)^2 \equiv _k0$$ Multiplying last equation with 16 we get $$0\equiv _k((2n)^2-2(2n)-4)^2\equiv _k 25$$ So $$2n-1\mid 25 \implies 2n-1\in\{\pm 1,\pm5,\pm 25\}$$


You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .