A note on a multiplicative function

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on strongly multiplicative graphs

In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicative graph of order n, which is sharper than the upper bound obtained by Beineke and Hegde [1].

متن کامل

A Note on the Multiplicative AHP

The paper concerns the pairwise comparison method used to rank a finite, usually small number of alternatives, in the Analytic Hierarchy Process (AHP), which belongs to a certain class of multiple attribute decision making methods. Ranking of alternatives is calculated based on expert judgments expressing relative importance for each pair of alternatives. From mathematical point of view calcula...

متن کامل

On a Multiplicative Partition Function

Let D(s) = ∑∞ m=1 amm −s be the Dirichlet series generated by the infinite product ∏∞ k=2(1− k−s). The value of am for squarefree integers m with n prime factors depends only on the number n, and we let f(n) denote this value. We prove an asymptotic estimate for f(n) which allows us to solve several problems raised in a recent paper by M. V. Subbarao and A. Verma.

متن کامل

A Note on the Multiplicative Group of a Division Ring

Let K be a noncommutative division ring with center Z and multiplicative group K*. Hua [2; 3] proved that (i) K*/Z* is a group without center, and (ii) K* is not solvable. A generalization (Theorem 1) will be given here which contains as a special case (Theorem 2) the fact that K*/Z* has no Abelian normal subgroups. This latter theorem obviously contains both (i) and (ii). As a further corollar...

متن کامل

A Note on Multiplicative Backward Errors of Accurate SVD Algorithms

Multiplicative backward stability results are presented for two algorithms which compute the singular value decomposition of dense matrices. These algorithms are the classical onesided Jacobi algorithm, with a stringent stopping criterion, and an algorithm which uses one-sided Jacobi to compute high accurate singular value decompositions of matrices given as rank-revealing factorizations. When ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales Polonici Mathematici

سال: 1968

ISSN: 0066-2216,1730-6272

DOI: 10.4064/ap-21-1-29-31