Displaying similar documents to “Generalizing the arithmetic geometric mean - a hapless computer experiment.”

On a question of A. Schinzel: Omega estimates for a special type of arithmetic functions

Manfred Kühleitner, Werner Nowak (2013)

Open Mathematics

Similarity:

The paper deals with lower bounds for the remainder term in asymptotics for a certain class of arithmetic functions. Typically, these are generated by a Dirichlet series of the form ζ 2(s)ζ(2s−1)ζ M(2s)H(s), where M is an arbitrary integer and H(s) has an Euler product which converges absolutely for R s > σ0, with some fixed σ0 < 1/2.

On certain arithmetic functions involving the greatest common divisor

Ekkehard Krätzel, Werner Nowak, László Tóth (2012)

Open Mathematics

Similarity:

The paper deals with asymptotics for a class of arithmetic functions which describe the value distribution of the greatest-common-divisor function. Typically, they are generated by a Dirichlet series whose analytic behavior is determined by the factor ζ2(s)ζ(2s − 1). Furthermore, multivariate generalizations are considered.

Digits and continuants in euclidean algorithms. Ergodic versus tauberian theorems

Brigitte Vallée (2000)

Journal de théorie des nombres de Bordeaux

Similarity:

We obtain new results regarding the precise average-case analysis of the main quantities that intervene in algorithms of a broad Euclidean type. We develop a general framework for the analysis of such algorithms, where the average-case complexity of an algorithm is related to the analytic behaviour in the complex plane of the set of elementary transformations determined by the algorithms. The methods rely on properties of transfer operators suitably adapted from dynamical systems theory...