On the maximum row and column sum norm of GCD and related matrices.
We provide upper bounds for the mean square integralwhere and lies in a suitable range. For a fixed integer, is the error term in the asymptotic formula for the summatory function of the divisor function , generated by .
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, , 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]....