Évaluations asymptotiques concernant des fonctions multiplicatives définies sur certains semi-groupes
Let denote the number of representations of the positive number n as the sum of two squares and s biquadrates. When or 4, it is established that the anticipated asymptotic formula for holds for all with at most exceptions.
We obtain some approximate identities whose accuracy depends on the bottom of the discrete spectrum of the Laplace-Beltrami operator in the automorphic setting and on the symmetries of the corresponding Maass wave forms. From the geometric point of view, the underlying Riemann surfaces are classical modular curves and Shimura curves.
We note that every positive integer N has a representation as a sum of distinct members of the sequence , where d(m) is the number of divisors of m. When N is a member of a binary recurrence satisfying some mild technical conditions, we show that the number of such summands tends to infinity with n at a rate of at least c₁logn/loglogn for some positive constant c₁. We also compute all the Fibonacci numbers of the form d(m!) and d(m₁!) + d(m₂)! for some positive integers m,m₁,m₂.
We prove that the error term differs from (ψ(x)-x)/x by a well controlled function. We deduce very precise numerical results from the formula obtained.
We prove that for every x > q ≥ 1, and similar estimates for the Liouville function. We also give better constants when x/q is large.,
Given a multivariate polynomial with integral coefficients verifying an hypothesis of analytic regularity (and satisfying ), we determine the maximal domain of meromorphy of the Euler product and the natural boundary is precisely described when it exists. In this way we extend a well known result for one variable polynomials due to Estermann from 1928. As an application, we calculate the natural boundary of the multivariate Euler products associated to a family of toric varieties.
The history of the construction, organisation and publication of factor tables from 1657 to 1817, in itself a fascinating story, also touches upon many topics of general interest for the history of mathematics. The considerable labour involved in constructing and correcting these tables has pushed mathematicians and calculators to organise themselves in networks. Around 1660 J. Pell was the first to motivate others to calculate a large factor table, for which he saw many applications, from Diophantine...