We introduce some generalisations of the Euler–Kronecker constant of a number field and study their arithmetic nature.

It is known that the Fourier–Stieltjes coefficients of a nonatomic coin-tossing measure may not vanish at infinity. However, we show that they could vanish at infinity along some integer subsequences, including the sequence ${\{b^{n}\}}_{n\geq 1}$ where $b$ is multiplicatively independent of 2 and the sequence given by the multiplicative semigroup generated by 3 and 5. The proof is based on elementary combinatorics and lower-bound estimates for linear forms in logarithms from transcendental number theory.

In 1939, Erdös and Mahler [‘Some arithmetical properties of the convergents of a continued fraction’, J. Lond. Math. Soc. (2)14 (1939), 12–18] studied some arithmetical properties of the convergents of a continued fraction. In particular, they raised a conjecture related to continued fractions and Liouville numbers. In this paper, we shall apply the theory of linear forms in logarithms to obtain a result in the direction of this problem.

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$.