The Euler–Mascheroni constant $\gamma =0.5772\ldots \!$ is the $K={\mathbb Q}$ example of an Euler–Kronecker constant $\gamma _K$ of a number field $K.$ In this note, we consider the size of the $\gamma _q=\gamma _{K_q}$ for cyclotomic fields $K_q:={\mathbb Q}(\zeta _q).$ Assuming the Elliott–Halberstam Conjecture (EH), we prove uniformly in Q that

$$ \begin{align*} \frac{1}{Q}\sum_{Q<q\le 2Q} |{\gamma_q - \log q}| = o(\log Q).\end{align*} $$

In other words, under EH, the $\gamma _q /\!\log q$ in these ranges converge to the one point distribution at $1$ . This theorem refines and extends a previous result of Ford, Luca and Moree for prime $q.$ The proof of this result is a straightforward modification of earlier work of Fouvry under the assumption of EH.

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.

Following Bridgeman, we demonstrate several families of infinite dilogarithm identities associated with Fibonacci numbers, Lucas numbers, convergents of continued fractions of even periods, and terms arising from various recurrence relations.

In [5], Chen and Yui conjectured that Gross–Zagier type formulas may also exist for Thompson series. In this work, we verify Chen and Yui’s conjecture for the cases for Thompson series $j_{p}(\tau )$ for $\Gamma _{0}(p)$ for p prime, and equivalently establish formulas for the prime decomposition of the resultants of two ring class polynomials associated to $j_{p}(\tau )$ and imaginary quadratic fields and the prime decomposition of the discriminant of a ring class polynomial associated to $j_{p}(\tau )$ and an imaginary quadratic field. Our method for tackling Chen and Yui’s conjecture on resultants can be used to give a different proof to a recent result of Yang and Yin. In addition, as an implication, we verify a conjecture recently raised by Yang, Yin, and Yu.

We consider the sum $\sum 1/\gamma $ , where $\gamma $ ranges over the ordinates of nontrivial zeros of the Riemann zeta-function in an interval $(0,T]$ , and examine its behaviour as $T \to \infty $ . We show that, after subtracting a smooth approximation $({1}/{4\pi }) \log ^2(T/2\pi ),$ the sum tends to a limit $H \approx -0.0171594$ , which can be expressed as an integral. We calculate H to high accuracy, using a method which has error $O((\log T)/T^2)$ . Our results improve on earlier results by Hassani [‘Explicit approximation of the sums over the imaginary part of the non-trivial zeros of the Riemann zeta function’, Appl. Math. E-Notes16 (2016), 109–116] and other authors.

This paper starts from the observation that the standard arguments for compositionality are really arguments for the computability of semantics. Since computability does not entail compositionality, the question of what justifies compositionality recurs. The paper then elaborates on the idea of recursive semantics as corresponding to computable semantics. It is then shown by means of time complexity theory and with the use of term rewriting as systems of semantic computation, that syntactically unrestricted, noncompositional recursive semantics leads to computational explosion (factorial complexity). Hence, with combinatorially unrestricted syntax, semantics with tractable time complexity is compositional.

For a positive real number $t$, define the harmonic continued fraction

$$\begin{eqnarray}\text{HCF}(t)=\biggl[\frac{t}{1},\frac{t}{2},\frac{t}{3},\ldots \biggr].\end{eqnarray}$$

$$\begin{eqnarray}\text{HCF}(t)=\frac{1}{1-2t(\frac{1}{t+2}-\frac{1}{t+4}+\frac{1}{t+6}-\cdots \,)}.\end{eqnarray}$$

We give a new hypergeometric construction of rational approximations to ζ(4), which absorbs the earlier one from 2003 based on Bailey's 9F8 hypergeometric integrals. With the novel ingredients we are able to gain better control of the arithmetic and produce a record irrationality measure for ζ(4).

Let $f(x)=x^{6}+ax^{4}+bx^{2}+c$ be an irreducible sextic polynomial with coefficients from a field $F$ of characteristic $\neq 2$, and let $g(x)=x^{3}+ax^{2}+bx+c$. We show how to identify the conjugacy class in $S_{6}$ of the Galois group of $f$ over $F$ using only the discriminants of $f$ and $g$ and the reducibility of a related sextic polynomial. We demonstrate that our method is useful for producing one-parameter families of even sextic polynomials with a specified Galois group.

A Heron triangle is a triangle that has three rational sides $(a,b,c)$ and a rational area, whereas a perfect triangle is a Heron triangle that has three rational medians $(k,l,m)$. Finding a perfect triangle was stated as an open problem by Richard Guy [Unsolved Problems in Number Theory (Springer, New York, 1981)]. Heron triangles with two rational medians are parametrized by the eight curves $C_{1},\ldots ,C_{8}$ mentioned in Buchholz and Rathbun [‘An infinite set of heron triangles with two rational medians’, Amer. Math. Monthly 104(2) (1997), 106–115; ‘Heron triangles and elliptic curves’, Bull. Aust. Math.Soc. 58 (1998), 411–421] and Bácskái et al. [Symmetries of triangles with two rational medians, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.65.6533, 2003]. In this paper, we reveal results on the curve $C_{4}$ which has the property of satisfying conditions such that six of seven parameters given by three sides, two medians and area are rational. Our aim is to perform an extensive search to prove the nonexistence of a perfect triangle arising from this curve.

A theorem of Gekeler compares the number of non-isomorphic automorphic representations associated with the space of cusp forms of weight $k$ on $\unicode[STIX]{x0393}_{0}(N)$ to a simpler function of $k$ and $N$, showing that the two are equal whenever $N$ is squarefree. We prove the converse of this theorem (with one small exception), thus providing a characterization of squarefree integers. We also establish a similar characterization of prime numbers in terms of the number of Hecke newforms of weight $k$ on $\unicode[STIX]{x0393}_{0}(N)$.

It follows that a hypothetical fast algorithm for computing the number of such automorphic representations for even a single weight $k$ would yield a fast test for whether $N$ is squarefree. We also show how to obtain bounds on the possible square divisors of a number $N$ that has been found not to be squarefree via this test, and we show how to probabilistically obtain the complete factorization of the squarefull part of $N$ from the number of such automorphic representations for two different weights. If in addition we have the number of such Hecke newforms for even a single weight $k$, then we show how to probabilistically factor $N$ entirely. All of these computations could be performed quickly in practice, given the number(s) of automorphic representations and modular forms as input.

We improve some previously known deterministic algorithms for finding integer solutions $x,y$ to the exponential equation of the form $af^{x}+bg^{y}=c$ over finite fields.

We record $\binom{42}{2}+\binom{23}{2}+\binom{13}{2}=1192$ functional identities that, apart from being amazingly amusing in themselves, find application in the derivation of Ramanujan-type formulas for $1/\unicode[STIX]{x1D70B}$ and in the computation of mathematical constants.

We use properties of the gamma function to estimate the products $\prod _{k=1}^{n}(4k-3)/4k$ and $\prod _{k=1}^{n}(4k-1)/4k$, motivated by the work of Chen and Qi [‘Completely monotonic function associated with the gamma function and proof of Wallis’ inequality’, Tamkang J. Math.36(4) (2005), 303–307] and Mortici et al. [‘Completely monotonic functions and inequalities associated to some ratio of gamma function’, Appl. Math. Comput.240 (2014), 168–174].

In this paper, we prove some conjectures of K. Stolarsky concerning the first and third moments of the Beatty sequences with the golden section and its square.

Let $G$ be a semisimple Lie group with associated symmetric space $D$, and let $\unicode[STIX]{x1D6E4}\subset G$ be a cocompact arithmetic group. Let $\mathscr{L}$ be a lattice inside a $\mathbb{Z}\unicode[STIX]{x1D6E4}$-module arising from a rational finite-dimensional complex representation of $G$. Bergeron and Venkatesh recently gave a precise conjecture about the growth of the order of the torsion subgroup $H_{i}(\unicode[STIX]{x1D6E4}_{k};\mathscr{L})_{\operatorname{tors}}$ as $\unicode[STIX]{x1D6E4}_{k}$ ranges over a tower of congruence subgroups of $\unicode[STIX]{x1D6E4}$. In particular, they conjectured that the ratio $\log |H_{i}(\unicode[STIX]{x1D6E4}_{k};\mathscr{L})_{\operatorname{tors}}|/[\unicode[STIX]{x1D6E4}:\unicode[STIX]{x1D6E4}_{k}]$ should tend to a nonzero limit if and only if $i=(\dim (D)-1)/2$ and $G$ is a group of deficiency $1$. Furthermore, they gave a precise expression for the limit. In this paper, we investigate computationally the cohomology of several (non-cocompact) arithmetic groups, including $\operatorname{GL}_{n}(\mathbb{Z})$ for $n=3,4,5$ and $\operatorname{GL}_{2}(\mathscr{O})$ for various rings of integers, and observe its growth as a function of level. In all cases where our dataset is sufficiently large, we observe excellent agreement with the same limit as in the predictions of Bergeron–Venkatesh. Our data also prompts us to make two new conjectures on the growth of torsion not covered by the Bergeron–Venkatesh conjecture.

Robin’s criterion states that the Riemann hypothesis is true if and only if $\unicode[STIX]{x1D70E}(n)<e^{\unicode[STIX]{x1D6FE}}n\log \log n$ for every positive integer $n\geq 5041$. In this paper we establish a new unconditional upper bound for the sum of divisors function, which improves the current best unconditional estimate given by Robin. For this purpose, we use a precise approximation for Chebyshev’s $\unicode[STIX]{x1D717}$-function.

This paper investigates interrelated price online inventory problems, in which decisions as to when and how much of a product to replenish must be made in an online fashion to meet some demand even without a concrete knowledge of future prices. The objective of the decision maker is to minimize the total cost while meeting the demands. Two different types of demand are considered carefully, that is, demands which are linearly and exponentially related to price. In this paper, the prices are online, with only the price range variation known in advance, and are interrelated with the preceding price. Two models of price correlation are investigated, namely, an exponential model and a logarithmic model. The corresponding algorithms of the problems are developed, and the competitive ratios of the algorithms are derived as the solutions by use of linear programming.

We generate ray-class fields over imaginary quadratic fields in terms of Siegel–Ramachandra invariants, which are an extension of a result of Schertz. By making use of quotients of Siegel–Ramachandra invariants we also construct ray-class invariants over imaginary quadratic fields whose minimal polynomials have relatively small coefficients, from which we are able to solve certain quadratic Diophantine equations.