Displaying 61 – 80 of 99

Showing per page

On the number of abelian groups of a given order (supplement)

Hong-Quan Liu (1993)

Acta Arithmetica

1. Introduction. The aim of this paper is to supply a still better result for the problem considered in [2]. Let A(x) denote the number of distinct abelian groups (up to isomorphism) of orders not exceeding x. We shall prove Theorem 1. For any ε > 0, A ( x ) = C x + C x 1 / 2 + C x 1 / 3 + O ( x 50 / 199 + ε ) , where C₁, C₂ and C₃ are constants given on page 261 of [2]. Note that 50/199=0.25125..., thus improving our previous exponent 40/159=0.25157... obtained in [2]. To prove Theorem 1, we shall proceed along the line of approach presented in [2]....

On the number of subgroups of finite abelian groups

Aleksandar Ivić (1997)

Journal de théorie des nombres de Bordeaux

Let T ( x ) = K 1 x log 2 x + K 2 x log x + K 3 x + Δ ( x ) , where T ( x ) denotes the number of subgroups of all abelian groups whose order does not exceed x and whose rank does not exceed 2 , and Δ ( x ) is the error term. It is proved that 1 X Δ 2 ( x ) d x X 2 log 31 / 3 X , 1 X Δ 2 ( x ) d x = Ω ( X 2 log 4 X ) .

On the value distribution of a class of arithmetic functions

Werner Georg Nowak (1996)

Commentationes Mathematicae Universitatis Carolinae

This article deals with the value distribution of multiplicative prime-independent arithmetic functions ( α ( n ) ) with α ( n ) = 1 if n is N -free ( N 2 a fixed integer), α ( n ) > 1 else, and α ( 2 n ) . An asymptotic result is established with an error term probably definitive on the basis of the present knowledge about the zeros of the zeta-function. Applications to the enumerative functions of Abelian groups and of semisimple rings of given finite order are discussed.

Currently displaying 61 – 80 of 99