<s>[INST] Solving the diophantine equation $p^2+n-3=6^n+n^6$ 
What are the pairs ($p,n$) of non-negative integers where $p$ is a prime number, such that $$p^2+n-3=6^n+n^6$$  

How can I solve  this diophantine equation?
 [/INST] If $n \equiv 0,1\pmod3$, we have $3$ divides $6^n+n^6 - n+3$, except for $n=0$. Further, for $n=1$, we have $6^n+n^6 - n+3 = 9 = 3^2$. Hence, $n \equiv 2\pmod3$. However, if $n \equiv 2 \pmod3$, we have $$6^n+n^6 - n+3 \equiv 2\pmod3$$ and no square is $2 \pmod 3$. Hence, the solutions are $(n,p) = (0,2)$ and $(n,p) = (1,3)$.
</s>