TITLE: Most wanted Diophantine equations
QUESTION [15 upvotes]: For most of my life, one single (family of) Diophantine equation(s) dominated the list of the world's most celebrated unsolved mathematical problems.  Perhaps the world we live in now has grown too sophisticated for such heavy focus on such a narrow question (visions of Fermat's MO postings getting closed as "Too localized"), but if not:

What specific unsolved Diophantine equations would today's number theorists most like to crack?  (And why - historical provenance, application to another part of mathematics, "test" question for a major arithmetical theory, etc.) 

"Specific" means, for example, "solve BSD, etc. to find an algorithm to decide the solvability of all elliptic curves" doesn't count, nor is this is the place to talk about
anything like the $abc$ conjecture.
Answers should not depend on any sort of coding, Matiyasevich-style.

REPLY [6 votes]: You may be interested in Some open problems about diophantine equations; it says, "We have collected some open problems which were posed by participants of an instructional conference (May 7-11, 2007) and a subsequent more advanced workshop (May 14-16, 2007) on solvability of Diophantine equations, both held at the Lorentz Center of Leiden University, The Netherlands. Among the 22 problems posed: 
Find all integer solutions to the equation $x^2-x=y^5-y$. 
Do the same for the equation ${x\choose2}={y\choose5}$. 
Determine all arithmetic progressions of the form $a^2,b^2,c^2,d^5$ where $a,b,c,d$ are integers with $\gcd(a,b)=1$. 
Are there infinitely many positive integer solutions to ${x^3-1\over y^3-1}=z^2$?