1975
DOI: 10.1017/s144678870002070x
|View full text |Cite
|
Sign up to set email alerts
|

On a subgroup of the group of multiplicative arithmetic functions

Abstract: 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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
22
0

Year Published

1995
1995
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 20 publications
(22 citation statements)
references
References 7 publications
0
22
0
Order By: Relevance
“…Such functions were first studied by Vaidyanathaswamy [23] in 1931, and later by several authors; see, for example, [4,6,7,9,10,13,16,18,20]. Two important classes of rational functions are Ꮿ(1,1) whose elements are known as totients, and Ꮿ(2,0) whose elements are the so-called specially multiplicative functions.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Such functions were first studied by Vaidyanathaswamy [23] in 1931, and later by several authors; see, for example, [4,6,7,9,10,13,16,18,20]. Two important classes of rational functions are Ꮿ(1,1) whose elements are known as totients, and Ꮿ(2,0) whose elements are the so-called specially multiplicative functions.…”
Section: Introductionmentioning
confidence: 99%
“…For f ∈ Ꮽ, f (1) ∈ R + , the Rearick logarithm of f (see [11,14,15]), denoted by Log f ∈ Ꮽ, is defined via (Log f )(1) = log f (1), 4) where df (n) = f (n)logn denotes the log derivation of f . The Hsu's generalized Möbius function (see [2]) µ r , r ∈ R, is defined as µ r (n) = p|n r ν p (n) (−1) νp(n) , (1.5) where ν p (n) is the highest power of the prime p dividing n. It is known (see [8,12]) that for f ∈ ᏹ, 6) and the converse holds under additional hypotheses.…”
Section: Introductionmentioning
confidence: 99%
“…We use this to generalize the results of [10] to an arbitrary ring and to answer a question posed in [22]. In Section 8, we prove some results about the order of a rational arithmetic function [6]. In Section 9, we address the question: given a multiplicative R-arithmetic function f , which powers of f are rational?…”
Section: Introductionmentioning
confidence: 97%
“…The group of rational R-arithmetic functions, denoted Rat(R), is the subgroup of Mul(R) generated by the completely multiplicative functions [6]. It is a subring of Mul(R) by Theorem 1.1(3a).…”
Section: Introductionmentioning
confidence: 99%
“…This is a more natural definition than the standard definition of powers due to Rearick [15] -which assumes that A = R or A = C -in terms of his logarithmic and exponential operators. Moreover, further knowledge of this Bin U (A)-algebra structure can yield useful information, say, about the powers of a given multiplicative function that are rational, in the sense of Carroll-Gioia [6]. This topic will be taken up elsewhere.…”
Section: Introductionmentioning
confidence: 99%