We refine a previous construction by Akhtari and Bhargava so that, for every positive integer m, we obtain a positive proportion of Thue equations F(x, y) = h that fail the integral Hasse principle simultaneously for every positive integer h less than m. The binary forms F have fixed degree ≥ 3 and are ordered by the absolute value of the maximum of the coefficients.

We solve several multi-parameter families of binomial Thue equations of arbitrary degree; for example, we solve the equation

$${{5}^{u}}{{x}^{n}}-{{2}^{r}}{{3}^{5}}{{y}^{n}}=\pm 1,$$

in non-zero integers $x,y$ and positive integers $u,r,s$ and $n\ge 3$. Our approach uses several Frey curves simultaneously, Galois representations and level-lowering, new lower bounds for linear forms in 3 logarithms due to Mignotte and a famous theorem of Bennett on binomial Thue equations.

This is the second in a series of papers where we combine the classical approach to exponential Diophantine equations (linear forms in logarithms, Thue equations, etc.) with a modular approach based on some of the ideas of the proof of Fermat's Last Theorem. In this paper we use a general and powerful new lower bound for linear forms in three logarithms, together with a combination of classical, elementary and substantially improved modular methods to solve completely the Lebesgue–Nagell equation x2 + D = yn, x, y integers, $n\geq 3$, for D in the range $1 \leq D \leq 100$.