a good asymptotic order of the Goldbach function is indeed equivalent to the Riemann Hypothesis

We determine the asymptotic behaviour of the number of Eulerian circuits in undirected simple graphs with large algebraic connectivity (the second-smallest eigenvalue of the

Section 2.4 recalls two explicit formulas (see (2.37) and (2.38)) of prime number theory, some results about the roots of the Riemann ζ function, and explains the computation of

Unit´e de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unit´e de recherche INRIA Rh ˆone-Alpes, 655, avenue de l’Europe, 38330 MONTBONNOT

An original numerical method is developed to solve the mechanical problem of stiff interface at order 1, based on the Nitsche’s method.. Several numerical examples are provided to

Sums of Kloosterman sums in arithmetic progressions, and the error term in the dispersion method. Residue classes containing an unexpected number

An original numerical method is developed to solve the mechanical problem of stiff interface at order 1, based on the Nitsche’s method.. Several numerical examples are provided to

One could wonder whether assuming the Riemann Hy- pothesis generalized to Dirichlet L-functions (GRH) allows for power-saving error term to be obtained (as is the case for the

An appendix by Oriol Serra furthermore provides the reader with a simple proof of the special case of Kneser’s Theorem that we need, namely with equal summands.. We recall