For every positive integer $n$, an infinite family of positive integral solutions of the diophantine equation $x^n - y^n = z^{n+1}$ is constructed.
Notes on the Diophantine Equation A^4+aB^4=C^4+aD^4
The Diophantine equation $aX^{4} - bY^{2} = 1$
Is there an algorithm which takes as input a Diophantine equation, returns an integer, and this integer is greater than the number of integer solutions, if the solution set is finite?
![QR code for arXiv:1612.03768 [math.NT]](http://oss.arxitics.com/images/favicon.svg)