On an algorithm which produces the g.c.d. of a set of n (n>2) integers in a simultaneous manner.
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.
We compare the growth of the least common multiple of the numbers and , where is a Lucas sequence and is some sequence of positive integers.