相关论文: The moments of split greatest common divisors

Let $(u_n)_{n \geq 0}$ be a non-degenerate Lucas sequence, given by the relation $u_n=a_1 u_{n-1}+a_2 u_{n-2}$. Let $\ell_u(m)=lcm(m, z_u(m))$, for $(m,a_2)=1$, where $z_u(m)$ is the rank of appearance of $m$ in $u_n$. We prove that…

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…

Let $(u_n)_{n \ge 0}$ be a nondegenerate Lucas sequence and $g_u(n)$ be the arithmetic function defined by $\gcd(n, u_n).$ Recent studies have investigated the distributional characteristics of $g_u$. Numerous results have been proven based…

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…

We explore the sums of $k$ consecutive terms in the generalized Fibonacci sequence $\left(G_n\right)_{n \geq 0}$ given by the recurrence $G_n = G_{n-1} + G_{n-2}$ for all $n \geq 2$ with integral initial conditions $G_0$ and $G_1$. In…

Let $\gcd(k,j)$ be the greatest common divisor of the integers $k$ and $j$. For any arithmetical function $f$, we establish several asymptotic formulas for weighted averages of gcd-sum functions with weight concerning logarithms, that is…

The sum of proper divisors function $s(n)$ has been studied for more than 2000 years. In this paper we study statistical properties of the related function $S_s(n) := \sum_{d \mid n} s(d)$. This function arises from a generalization of the…

We investigate the divisibility properties of \sigma(C_n), the sum-of-divisors function applied to Catalan numbers, in relation to other number-theoretic functions. We establish conditions under which C_n has prime factors of the form 6k-1,…

We prove an asymptotic formula for the sum $\sum_{n \leq N} d(n^2 - 1)$, where $d(n)$ denotes the number of divisors of $n$. During the course of our proof, we also furnish an asymptotic formula for the sum $\sum_{d \leq N} g(d)$, where…

We study the distribution of the generalized gcd and lcm functions on average. The generalized gcd function, denoted by $(m,n)_b$, is the largest $b$-th power divisor common to $m$ and $n$. Likewise, the generalized lcm function, denoted by…

Let $d,n$ be positive integers and $S$ be an arbitrary set of positive integers. We say that $d$ is an $S$-divisor of $n$ if $d|n$ and gcd $(d,n/d)\in S$. Consider the $S$-convolution of arithmetical functions given by (1.1), where the sum…

N. Minculete has introduced a concept of divisors of order $r$: integer $d=p_1^{b_1}\cdots p_k^{b_k} $ is called a divisor of order $r$ of $n=p_1^{a_1}\cdots p_k^{a_k}$ if $d \mid n$ and $b_j\in\{r, a_j\}$ for $j=1,\ldots,k$. One can…

We study the 'critical moments' of subcritical Gaussian multiplicative chaos (GMCs) in dimensions $d \leq 2$. In particular, we establish a fully explicit formula for the leading order asymptotics, which is closely related to large…

We investigate fractional sums of arithmetic functions over products of two or three integers, with emphasis on fixed greatest common divisors and multiplicative weights. Let $f$ be an arithmetic function satisfying $f(n) \ll n^\alpha$ for…

In this note, we study the divisibility relation $U_m\mid U_{n+k}^s-U_n^s$, where ${\bf U}:=\{U_n\}_{n\ge 0}$ is the Lucas sequence of characteristic polynomial $x^2-ax\pm 1$ and $k,m,n,s$ are positive integers.

We present an analytic method for computing the moments of a sum of independent and identically distributed random variables. The limiting behavior of these sums is very important to statistical theory, and the moment expressions that we…

We study the variance of sums of the $k$-fold divisor function $d_k(n)$ over sparse arithmetic progressions, with averaging over both residue classes and moduli. In a restricted range, we confirm an averaged version of a recent conjecture…

Let $\gcd(m,n)$ denote the greatest common divisor of the positive integers $m$ and $n$, and let $\mu$ represent the M\" obius function. For any real number $x>5$, we define the summatory function of the M\" obius function involving the…

Let $\gcd(d_{1},\ldots,d_{k})$ be the greatest common divisor of the positive integers $d_{1},\ldots,d_{k}$, for any integer $k\geq 2$, and let $\tau$ and $\mu$ denote the divisor function and the M\"{o}bius function, respectively. For an…

We study upper bounds for the counting function of common zeros of two meromorphic functions in various contexts. The proofs and results are inspired by recent work involving greatest common divisors in Diophantine approximation, to which…