Let $p$, be a prime, $p\ge 3$. Consider the equation $X^4+4=pY^4$. Prove that the only solution is $X=\pm 1,Y=\pm 1,p=5$
Hint: $x^4+4=(x^2-2x+2)(x^2+2x+2)$. I've tried Fermat's Little Theorem and the linear Diophantine Equation, but it doesn't work. I have been taught Congruence
Suppose $x,y\geq 0$ and let $g:= \gcd(x^2-2x+2,x^2+2x+2)$
Let prime $q\mid g$ then $q\mid 4x$. If $q\ne 2$ then $q\mid x$ but then $$q\mid x^2+2x \implies q\mid 2 \implies q=2$$
So the only prime which can divide $ \gcd(x^2-2x+2,x^2+2x+2)$ is 2.
$\color{red}{Case\; 2.1}$: $$(x+1)^2<x^2+2x+2 < (x+2)^2$$ so no solution.