Generating Functions for a Class of Arithmetic Functions

1966 ◽  
Vol 9 (4) ◽  
pp. 427-431 ◽  
Author(s):  
A. A. Gioia ◽  
M.V. Subbarao
Keyword(s):  
Generating Functions ◽  
Multiplicative Function ◽  
Arithmetic Function ◽  
Arithmetic Functions ◽  
Prime Divisors ◽  
Image Position

In this note the arithmetic functions L(n) and w(n) denote respectively the number and product of the distinct prime divisors of the integer n ≥ 1, and L(l) = 0, w(l) = 1. An arithmetic function f is called multiplicative if f(1) = 1 and f(mn) = f(m)f(n) whenever (m, n) = 1. It is known ([1], [3], [4]) that every multiplicative function f satisfies the identity1.1

Identities for Multiplicative Functions

1967 ◽  
Vol 10 (1) ◽  
pp. 65-73 ◽  
Author(s):  
M. V. Subbarao ◽  
A. A. Gioia
Keyword(s):  
Arithmetic Function ◽  
Arithmetic Functions ◽  
Greatest Common Divisor ◽  
Multiplicative Functions ◽  
Prime Divisors ◽  
Image Position

Throughout this paper the arithmetic functions L(n) and w(n) denote respectively the number and product of the distinct prime divisors of the integer n > 1, with L(1) = 0 and w(1) = 1. Also letWe recall that an arithmetic function f(n) is said to be multiplicative if f(1) = 1 and f(mn) = f(m)f(n) whenever (m, n) = 1, where (m, n) denotes as usual the greatest common divisor of m and n.

On average values of arithmetic functions

1941 ◽  
Vol 37 (4) ◽  
pp. 358-372 ◽  
Author(s):  
E. Fogels
Keyword(s):  
Arithmetic Function ◽  
Arithmetic Functions ◽  
Average Order ◽  
Image Position

The problem considered in this paper is that of finding the least possible h = h(x) such that a given arithmetic function a(n) should keep its average order in the interval x, x + h, i.e. that we haveandas x → ∞.

scholarly journals On a subgroup of the group of multiplicative arithmetic functions

1975 ◽  
Vol 20 (3) ◽  
pp. 348-358 ◽  
Author(s):  
T. B. Carroll ◽  
A. A. Gioia
Keyword(s):  
Abelian Group ◽  
Arithmetic Function ◽  
Arithmetic Functions ◽  
Greatest Common Divisor ◽  
Multiplicative Functions ◽  
Dirichlet Convolution ◽  
Image Position ◽  
Positive Integers ◽  
Multiplicative Arithmetic

An arithmetic function f is said to be multiplicative if f(1) = 1 and f(mn) = f(m)f(n) whenever (m, n) = 1, where (m, n) denotes as usual the greatest common divisor of m and n. Furthermore an arithmetic function is said to be linear (or completely multiplicative) if f(1) = 1 and f(mn) = f(m)f(n) for all positive integers m and n.The Dirichlet convolution of two arithmetic functions f and g is defined by for all n∈Z+. Recall that the set of all multiplicative functions, denoted by M, with this operation is an abelian group.

The law of large numbers for additive arithmetic functions

1975 ◽  
Vol 78 (1) ◽  
pp. 33-71 ◽  
Author(s):  
P. D. T. A. Elliott
Keyword(s):  
Law Of Large Numbers ◽  
Arithmetic Function ◽  
Sufficient Conditions ◽  
Growth Conditions ◽  
Arithmetic Functions ◽  
Additive Arithmetic ◽  
Large Numbers ◽  
Coprime Integers ◽  
Weak Growth ◽  
Image Position

Let f(n) be a real-valued additive arithmetic function, that is to say, that f(ab) = f(a) + f(b) for each pair of coprime integers a and b. Let α(x) and β(x) > 0 be real-valued functions, defined for x ≥ 2. In this paper, we study the frequenciesWe shall establish necessary and sufficient conditions, subject to rather weak growth conditions upon β(x) alone, in order that these frequencies converge to the improper law, in other words, that f(n) obey a form of the weak law of large numbers.

High-Power Analogues of the Turán-Kubilius Inequality, and an Application to Number Theory

1980 ◽  
Vol 32 (4) ◽  
pp. 893-907 ◽  
Author(s):  
P. D. T. A. Elliott
Keyword(s):  
Number Theory ◽  
Absolute Constant ◽  
Arithmetic Function ◽  
Standard Form ◽  
Arithmetic Functions ◽  
Additive Arithmetic ◽  
Coprime Integers ◽  
Complete Catalogue ◽  
Image Position ◽  
Complex Valued

An arithmetic function ƒ(n) is said to be additive if it satisfies ƒ(ab) = ƒ(a) + ƒ(b) whenever a and b are coprime integers. For such a function we defineA standard form of the Turán-Kubilius inequality states that(1)holds for some absolute constant c1, uniformly for all complex-valued additive arithmetic functions ƒ (n), and real x ≧ 2. An inequality of this type was first established by Turán [11], [12] subject to some side conditions upon the size of │ƒ(pm)│. For the general inequality we refer to [10].This inequality, and more recently its dual, have been applied many times to the study of arithmetic functions. For an overview of some applications we refer to [2]; a complete catalogue of the applications of the inequality (1) would already be very large. For some applications of the dual of (1) see [3], [4], and [1].

General asymptotic distributions for additive arithmetic functions

1976 ◽  
Vol 79 (1) ◽  
pp. 43-54 ◽  
Author(s):  
P. D. T. A. Elliott
Keyword(s):  
Arithmetic Function ◽  
Asymptotic Distributions ◽  
Arithmetic Functions ◽  
Additive Arithmetic ◽  
Additive Arithmetic Function ◽  
Image Position

1. Let f(n) be a real-valued additive arithmetic function. Let α(x) and β(x) > 0 be real valued functions, defined for x ≥ 2. Define the frequencies

scholarly journals A study on some generalized multiplicative and generalized additive arithmetic functions

2021 ◽  
Vol 27 (1) ◽  
pp. 32-44
Author(s):  
D. Bhattacharjee ◽  
Keyword(s):  
Additive Function ◽  
Multiplicative Function ◽  
Arithmetic Function ◽  
Arithmetic Functions ◽  
Additive Arithmetic ◽  
Positive Integers

In this paper by an arithmetic function we shall mean a real-valued function on the set of positive integers. We recall the definitions of some common arithmetic convolutions. We also recall the definitions of a multiplicative function, a generalized multiplicative function (or briefly a GM-function), an additive function and a generalized additive function (or briefly a GA-function). We shall study in details some properties of GM-functions as well as GA-functions using some particular arithmetic convolutions namely the Narkiewicz’s A-product and the author’s B-product. We conclude our discussion with some examples.

On calculating extinction probabilities for branching processes in random environments

1969 ◽  
Vol 6 (03) ◽  
pp. 478-492 ◽  
Author(s):  
William E. Wilkinson
Keyword(s):  
Generating Functions ◽  
Infinite Sequence ◽  
Branching Processes ◽  
Transition Probability ◽  
Transition Probability Matrix ◽  
Random Environments ◽  
Real Numbers ◽  
Discrete Time Markov Chain ◽  
Extinction Probabilities ◽  
Image Position

Consider a discrete time Markov chain {Zn } whose state space is the non-negative integers and whose transition probability matrix ║Pij ║ possesses the representation where {Pr }, r = 1,2,…, is a finite or denumerably infinite sequence of non-negative real numbers satisfying , and , is a corresponding sequence of probability generating functions. It is assumed that Z 0 = k, a finite positive integer.

The Generating Functions of Certain Special Determinants

1904 ◽  
Vol 24 ◽  
pp. 387-392 ◽  
Author(s):  
Thomas Muir
Keyword(s):  
Generating Functions ◽  
General Theorem ◽  
Image Position

(1) From a general theorem, known since 1855, and perhaps earlier, regarding the reciprocal of the seriesit follows thatwhere β0 = 1 and

Higher Moments of Fourier Coefficients of Cusp Forms

2015 ◽  
Vol 58 (3) ◽  
pp. 548-560
Author(s):  
Guangshi Lü ◽  
Ayyadurai Sankaranarayanan
Keyword(s):  
Modular Group ◽  
Fourier Coefficients ◽  
Arithmetic Function ◽  
Arithmetic Functions ◽  
Cusp Forms ◽  
Higher Moments ◽  
Integral Weight ◽  
Holomorphic Cusp Forms

AbstractLet Sk(Γ) be the space of holomorphic cusp forms of even integral weight k for the full modular group SL(z, ℤ). Let be the n-th normalized Fourier coefficients of three distinct holomorphic primitive cusp forms , and h(z) ∊ Sk3 (Γ), respectively. In this paper we study the cancellations of sums related to arithmetic functions, such as twisted by the arithmetic function λf(n).

Sign in / Sign up

Export Citation Format

Share Document