相关论文: Divisibility among power GCD and power LCM matrice…

For integers $x$ and $y$, $(x, y)$ and $[x, y]$ stand for the greatest common divisor and the least common multiple of $x$ and $y$ respectively. Denote by $|T|$ the number of elements of a finite set $T$. Let $a,b$ and $n$ be positive…

Let $a$ and $n$ be positive integers and let $S=\{x_1, \cdots, x_n\}$ be a set of $n$ distinct positive integers. For $x\in S$, one defines $G_{S}(x)=\{d\in S: d<x, d|x \ {\rm and} \ (d|y|x, y\in S)\Rightarrow y\in \{d,x\}\}$. We denote by…

Let $S=\{x_1,\ldots, x_n\}$ be a gcd-closed set (i.e. $(x_i,x_j)\in S $ for all $1\le i,j\le n$). In 2002, Hong proposed the divisibility problem of characterizing all gcd-closed sets $S$ with $|S|\ge 4$ such that the GCD matrix $(S)$…

Let $X = (x_1,\dots,x_n)$ be a vector of distinct positive integers. The $n \times n$ matrix $S = S(X) := (\gcd(x_i,x_j))_{i,j=1}^n$, where $\gcd(x_i,x_j)$ denotes the greatest common divisor of $x_i$ and $x_j$, is called the greatest…

Let $f$ be an arithmetical function. The matrix $[f(i,j)]_{n\times n}$ given by the value of $f$ in greatest common divisor of $(i,j)$, $f\big((i,j)\big)$ as its $i,\; j$ entry is called the greatest common divisor (GCD) matrix. We consider…

Let $S=\{x_1,x_2,\dots,x_n\}$ be a set of distinct positive integers, and let $f$ be an arithmetical function. The GCD matrix $(S)_f$ on $S$ associated with $f$ is defined as the $n\times n$ matrix having $f$ evaluated at the greatest…

Let $R$ be a gcd-domain (for example let $R$ be a unique factorization domain), and let $(a_n)_{n\geqslant1}$ be a sequence of nonzero elements in $R$. We prove that $\gcd(a_n,a_m)=a_{\gcd(n,m)}$ for all $n,m\geqslant1$ if and only if…

Let $S=\{s_{1},s_{2},\ldots,s_{n}\}$ be an ordered set of $n$ distinct positive integers. The $m$th-order $n$-dimensional tensor $T_{[S]}=(t_{i_{1}i_{2}\ldots i_{m}}),$ where $t_{i_{1}i_{2}\ldots…

Given an arithmetical function $f$, by $f(a, b)$ and $f[a, b]$ we denote the function $f$ evaluated at the greatest common divisor $(a, b)$ of positive integers $a$ and $b$ and evaluated at the least common multiple $[a, b]$ respectively. A…

In 1876 H. J. S. Smith defined an LCM matrix as follows: let S = {x_1, x_2, ..., x_n} be a set of positive integers. The LCM matrix [S] is the n $\times$ n matrix with lcm(x_i , x_j) as its ij entry. During the last 30 years singularity of…

In this note we prove the following fact: if finite many elements $p_1,p_2,...,p_n$ of a unique factorization domain are given such that the greatest common divisor of each pair $(p_i,p_j)$ can be expressed as a linear combination of $p_i$…

A divisibility sequence is a sequence of integers $\{d_n\}$ such that $d_m$ divides $d_n$ if $m$ divides $n$. Results of Bugeaud, Corvaja, Zannier, among others, have shown that the gcd of two divisibility sequences corresponding to…

We study some divisibility properties of multiperfect numbers. Our main result is: if $N=p_1^{\alpha_1}... p_s^{\alpha_s} q_1^{2\beta_1}... q_t^{2\beta_t}$ with $\beta_1, ..., \beta_t$ in some finite set S satisfies…

Let $p$ be a fixed prime, and let $v(a)$ stand for the exponent of $p$ in the prime factorization of the integer $a$. Let $f$ and $g$ be two monic polynomials with integer coefficients and nonzero resultant $r$. Write $S$ for the maximum of…

We generalize the well known Glaisher partition bijection result. For given positive integers n, d, both greater than 1, we provide a rich family of bijections between the set of partitions of n where at least one part is divisible by d,…

For given integers a,b, and j at least 1 we determine the set of integers n for which a^n-b^n is divisible by n^j. For j=1,2, this set is usually infinite; we find explicitly the exceptional cases for which a,b the set is finite. For j=2,…

Let $ G $ be a finite group of order $ n$. The strong power graph $\mathcal{P}_s(G) $ of $G$ is the undirected graph whose vertices are the elements of $G$ such that two distinct vertices $a$ and $b$ are adjacent if $a^{{m}_1}$=$b^{{m}_2}$…

Fix a prime $p$ and an integer $m$ with $p> m \geq 2$. Define the family of finite groups \[ G_n :=SL_m (\mathbb{Z}/p^{n}\mathbb{Z}) \] for $n=1,2,... $. We will prove that there exist two positive constants $C$ and $d$ such that for any…

In this paper we included some basic properties for weighted greatest common divisors, and discuss how to speed up computing the weighted greatest common divisor. By ordering the 'weights' we are able to significantly shorten the operations…

The matrix $S = [1+x_i y_j]_{i,j=1}^{n}, 0<x_1<\cdots<x_n,\, 0<y_1<\cdots<y_n$, has gained importance lately due to its role in powers preserving total nonnegativity. We give an explicit decomposition of $S$ in terms of elementary…