MORE ON A CERTAIN ARITHMETICAL DETERMINANT

2017 ◽  
Vol 97 (1) ◽  
pp. 15-25 ◽  
Author(s):  
ZONGBING LIN ◽  
SIAO HONG

Let $n\geq 1$ be an integer and $f$ be an arithmetical function. Let $S=\{x_{1},\ldots ,x_{n}\}$ be a set of $n$ distinct positive integers with the property that $d\in S$ if $x\in S$ and $d|x$. Then $\min (S)=1$. Let $(f(S))=(f(\gcd (x_{i},x_{j})))$ and $(f[S])=(f(\text{lcm}(x_{i},x_{j})))$ denote the $n\times n$ matrices whose $(i,j)$-entries are $f$ evaluated at the greatest common divisor of $x_{i}$ and $x_{j}$ and the least common multiple of $x_{i}$ and $x_{j}$, respectively. In 1875, Smith [‘On the value of a certain arithmetical determinant’, Proc. Lond. Math. Soc. 7 (1875–76), 208–212] showed that $\det (f(S))=\prod _{l=1}^{n}(f\ast \unicode[STIX]{x1D707})(x_{l})$, where $f\ast \unicode[STIX]{x1D707}$ is the Dirichlet convolution of $f$ and the Möbius function $\unicode[STIX]{x1D707}$. Bourque and Ligh [‘Matrices associated with classes of multiplicative functions’, Linear Algebra Appl. 216 (1995), 267–275] computed the determinant $\det (f[S])$ if $f$ is multiplicative and, Hong, Hu and Lin [‘On a certain arithmetical determinant’, Acta Math. Hungar. 150 (2016), 372–382] gave formulae for the determinants $\det (f(S\setminus \{1\}))$ and $\det (f[S\setminus \{1\}])$. In this paper, we evaluate the determinant $\det (f(S\setminus \{x_{t}\}))$ for any integer $t$ with $1\leq t\leq n$ and also the determinant $\det (f[S\setminus \{x_{t}\}])$ if $f$ is multiplicative.

2005 ◽  
Vol 2005 (6) ◽  
pp. 925-935 ◽  
Author(s):  
Pentti Haukkanen ◽  
Ismo Korkee

LetS={x1,x2,…,xn}be a set of positive integers, and letfbe an arithmetical function. The matrices(S)f=[f(gcd(xi,xj))]and[S]f=[f(lcm [xi,xj])]are referred to as the greatest common divisor (GCD) and the least common multiple (LCM) matrices onSwith respect tof, respectively. In this paper, we assume that the elements of the matrices(S)fand[S]fare integers and study the divisibility of GCD and LCM matrices and their unitary analogues in the ringMn(ℤ)of then×nmatrices over the integers.


Author(s):  
Guangyan Zhu

Let [Formula: see text] and [Formula: see text] be positive integers and let [Formula: see text] be a set of [Formula: see text] distinct positive integers. For [Formula: see text], one defines [Formula: see text]. We denote by [Formula: see text] (respectively, [Formula: see text]) the [Formula: see text] matrix having the [Formula: see text]th power of the greatest common divisor (respectively, the least common multiple) of [Formula: see text] and [Formula: see text] as its [Formula: see text]-entry. In this paper, we show that for arbitrary positive integers [Formula: see text] and [Formula: see text] with [Formula: see text], the [Formula: see text]th power matrices [Formula: see text] and [Formula: see text] are both divisible by the [Formula: see text]th power matrix [Formula: see text] if [Formula: see text] is a gcd-closed set (i.e. [Formula: see text] for all integers [Formula: see text] and [Formula: see text] with [Formula: see text]) such that [Formula: see text]. This confirms two conjectures of Shaofang Hong proposed in 2008.


1975 ◽  
Vol 20 (3) ◽  
pp. 348-358 ◽  
Author(s):  
T. B. Carroll ◽  
A. A. Gioia

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.


2016 ◽  
Vol 14 (1) ◽  
pp. 146-155 ◽  
Author(s):  
Siao Hong ◽  
Shuangnian Hu ◽  
Shaofang Hong

AbstractLet f be an arithmetic function and S= {x1, …, xn} be a set of n distinct positive integers. By (f(xi, xj)) (resp. (f[xi, xj])) we denote the n × n matrix having f evaluated at the greatest common divisor (xi, xj) (resp. the least common multiple [xi, xj]) of x, and xj as its (i, j)-entry, respectively. The set S is said to be gcd closed if (xi, xj) ∈ S for 1 ≤ i, j ≤ n. In this paper, we give formulas for the determinants of the matrices (f(xi, xj)) and (f[xi, xj]) if S consists of multiple coprime gcd-closed sets (i.e., S equals the union of S1, …, Sk with k ≥ 1 being an integer and S1, …, Sk being gcd-closed sets such that (lcm(Si), lcm(Sj)) = 1 for all 1 ≤ i ≠ j ≤ k). This extends the Bourque-Ligh, Hong’s and the Hong-Loewy formulas obtained in 1993, 2002 and 2011, respectively. It also generalizes the famous Smith’s determinant.


2008 ◽  
Vol 01 (02) ◽  
pp. 225-235 ◽  
Author(s):  
Shaofang Hong

Given an arbitrary strictly increasing infinite sequence [Formula: see text] of positive integers, let Sn = {x1,…, xn} for any integer n ≥ 1. Let q ≥ 1 be a given integer and f an arithmetical function. Let [Formula: see text] be the eigenvalues of the matrix (f(xi, xj)) having f evaluated at the greatest common divisor (xi, xj) of xi and xj as its i, j-entry. We obtain a lower bound depending only on x1 and n for [Formula: see text] if (f * μ)(d) < 0 whenever d|x for any x ∈ Sn, where g * μ is the Dirichlet convolution of f and μ. Consequently we show that for any sequence [Formula: see text], if f is a multiplicative function satisfying that f(pk) → ∞ as pk → ∞, f(2) > 1 and f(pm) ≥ f(2)f(pm−1) for any prime p and any integer m ≥ 1 and (f *μ)(d) > 0 whenever d|x for any [Formula: see text], then [Formula: see text] approaches infinity when n goes to infinity.


1996 ◽  
Vol 19 (2) ◽  
pp. 209-217 ◽  
Author(s):  
Pentti Haukkanen

An arithmetical function is said to be a totient if it is the Dirichlet convolution between a completely multiplicative function and the inverse of a completely multiplicative function. Euler's phi-function is a famous example of a totient. All completely multiplicative functions are also totients. There is a large number of characterizations of completely multiplicative functions in the literature, while characterizations of totients have not been widely studied in the literature. In this paper we present several arithmetical identities serving as characterizations of totients. We also introduce a new concrete example of a totient.


1974 ◽  
Vol 21 (5) ◽  
pp. 415-416
Author(s):  
Laurence Sherzer

Given the prime factors of two positive integers, the least common multiple (LCM) of these two numbers is the product of the union of these prime factors, and the greatest common factor (GCF) is the product of the intersection of these prime factors. If we could just state this fact to our students and be understood, our job of teaching them to find the LCM or the GCF of two numbers would be greatly simplified. Unfortunately, as in most teaching, simple verbal statements do not suffice.


2014 ◽  
Vol 57 (3) ◽  
pp. 551-561 ◽  
Author(s):  
Daniel M. Kane ◽  
Scott Duke Kominers

AbstractFor relatively prime positive integers u0 and r, we consider the least common multiple Ln := lcm(u0, u1..., un) of the finite arithmetic progression . We derive new lower bounds on Ln that improve upon those obtained previously when either u0 or n is large. When r is prime, our best bound is sharp up to a factor of n + 1 for u0 properly chosen, and is also nearly sharp as n → ∞.


Sign in / Sign up

Export Citation Format

Share Document