We describe how the quadratic Chabauty method may be applied to determine the set of rational points on modular curves of genus $g>1$ whose Jacobians have Mordell–Weil rank $g$. This extends our previous work on the split Cartan curve of level 13 and allows us to consider modular curves that may have few known rational points or non-trivial local height contributions at primes of bad reduction. We illustrate our algorithms with a number of examples where we determine the set of rational points on several modular curves of genus 2 and 3: this includes Atkin–Lehner quotients $X_0^+(N)$ of prime level $N$, the curve $X_{S_4}(13)$, as well as a few other curves relevant to Mazur's Program B. We also compute the set of rational points on the genus 6 non-split Cartan modular curve $X_{\scriptstyle \mathrm { ns}} ^+ (17)$.

We prove that $164\, 634\, 913$ is the smallest positive integer that is a sum of two rational sixth powers, but not a sum of two integer sixth powers. If $C_{k}$ is the curve $x^{6} + y^{6} = k$ , we use the existence of morphisms from $C_{k}$ to elliptic curves, together with the Mordell–Weil sieve, to rule out the existence of rational points on $C_{k}$ for various k.

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.

In this note, we find all the solutions of the Diophantine equation x2 + 5a 13b = yn in positive integers x, y, a, b, n≥ 3 with x and y coprime.

It is proven that if k ≥ 2 is an integer and d is a positive integer such that the product of any two distinct elements of the set increased by 1 is a perfect square, then d = 4k or d = 64k 5−48k 3+8k. Together with a recent result of Fujita, this shows that all Diophantine quadruples of the form {k − 1, k + 1, c, d} are regular.

Constants with formulae of the form treated by D. Bailey, P. Borwein, and S. Plouffe ($b$ formulae to a given base $b$) have interesting computational properties, such as allowing single digits in their base $b$ expansion to be independently computed, and there are hints that they should be normal numbers, i.e., that their base $b$ digits are randomly distributed. We study a formally limited subset of BBP formulae, which we call Machin-type BBP formulae, for which it is relatively easy to determine whether or not a given constant $K$ has a Machin-type BBP formula. In particular, given $b\,\in \,\mathbb{N},\,b\,>\,2,\,b$ not a proper power, a $b$-ary Machin-type BBP arctangent formula for $K$ is a formula of the form $k\,=\,{{\Sigma }_{m}}\,{{a}_{m}}\,\arctan \,(-{{b}^{-m}}),\,{{a}_{m}}\,\in \,\mathbb{Q}$ , while when $b\,=\,2$, we also allow terms of the form ${{a}_{m}}\,\arctan \,(1/1\,-\,{{2}^{m}}))$ . Of particular interest, we show that $\pi$ has no Machin-type BBP arctangent formula when $b\,\ne \,2$. To the best of our knowledge, when there is no Machin-type BBP formula for a constant then no BBP formula of any form is known for that constant.

In this paper, we derive a number of explicit lower bounds for rational approximation to certain cubic irrationalities, proving, for example, that for any non-zero integers p and q. A number of these irrationality measures improve known results, including those for . Some Diophantine consequences are briefly discussed.

We consider the Egyptian fraction equation and discuss techniques for generating solutions. By examining a quadratic recurrence relation modulo a family of primes we have found some 500 new infinite sequences of solutions. We also initiate an investigation of the randomness of the distribution of solutions, and show that there are infinitely many solutions not generated by the aforementioned technique.