Exposé des principes élémentaires de la théorie des déterminants, à l'usage des élèves de mathématiques spéciales
We use hyperbolic geometry to study the limiting behavior of the average number of ways of expressing a number as the sum of two coprime squares. An alternative viewpoint using analytic number theory is also given.
In this article we formalize some number theoretical algorithms, Euclidean Algorithm and Extended Euclidean Algorithm [9]. Besides the a gcd b, Extended Euclidean Algorithm can calculate a pair of two integers (x, y) that holds ax + by = a gcd b. In addition, we formalize an algorithm that can compute a solution of the Chinese remainder theorem by using Extended Euclidean Algorithm. Our aim is to support the implementation of number theoretic tools. Our formalization of those algorithms is based...
We give a method to extend Bell exponential polynomials to negative indices. This generalizes many results of this type such as the extension to negative indices of Stirling numbers or of Bernoulli numbers.
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.
This paper aims at the study of the notions of periodic, UU and semiclean properties in various context of commutative rings such as trivial ring extensions, amalgamations and pullbacks. The results obtained provide new original classes of rings subject to various ring theoretic properties.