A summation involving the number of divisors function and the GCD function

A summation of the number of distinct prime divisors of the lcm

Let $x$ be a positive integer. We give an asymptotic result for $ω(\operatorname{lcm}(m,n))$ summed over all positive integers $m$ and $n$ with $mn \le x$. This answers an open question posed in a recent paper.

Relatively Prime Sets, Divisor Sums, and Partial Sums

For a nonempty finite set $A$ of positive integers, let $\gcd\left(A\right)$ denote the greatest common divisor of the elements of $A$. Let $f\left(n\right)$ and $Φ\left(n\right)$ denote, respectively, the number of subsets $A$ of $\left\{1, 2, \ldots, n\right\}$ such that $\gcd\left(A\right) = 1$ and the number of subsets $A$ of $\left\{1, 2, \ldots, n\right\}$ such that $\gcd\left(A\cup\left\{n\right\}\right) =1$. Let $D\left(n\right)$ be the divisor sum of $f\left(n\right)$. In this article, we obtain partial sums of $f\left(n\right)$, $Φ\left(n\right)$ and $D\left(n\right)$. We also obtain…

On sums of arithmetic functions involving the greatest common divisor

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 $τ$ and $μ$ denote the divisor function and the Möbius function, respectively. For an arbitrary arithmetic function $g$ and for any real number $x>5$ and any integer $k\geq 3$, we define the sum $$ S_{g,k}(x) :=\sum_{n\leq x}\sum_{d_{1}\cdots d_{k}=n} g(\gcd(d_{1},\ldots,d_{k})) $$ In this paper, we give asymptotic formulas for $S_{τ,k}(x)$ and $S_{μ,k}(x)$ for $k\geq 3$.

计算二项式系数 $\binom{mn}{mk}$ 的最大公约数

Computing the Greatest Common Divisor of Binomial Coefficients $\binom{mn}{mk}$

本文研究了二项式系数 $\binom{mn}{mk}$ 的最大公约数，给出了 $m=2$ 时该 GCD 的完整刻画，并展示了在特定条件下高效计算的方法。

$\gcd(n,\phi(n))$ 的分布

The distribution of $\gcd(n,ϕ(n))$

本文研究 $\gcd(n,\phi(n))$ 及其因子的分布，推广了 Erdős 和 Pollack 的先前结果。

Another generalization of the gcd-sum function

We investigate an arithmetic function representing a generalization of the gcd-sum function, considered by Kurokawa and Ochiai in 2009 in connection with the multivariable global Igusa zeta function for a finite cyclic group. We show that the asymptotic properties of this function are closely connected to the Piltz divisor function. A generalization of Menon's identity is also considered.

Factorization Theorems for Relatively Prime Divisor Sums, GCD Sums and Generalized Ramanujan Sums

We generalize recent matrix-based factorization theorems for Lambert series generating functions generating the coefficients $(f \ast 1)(n)$ for some arithmetic function $f$. Our new factorization theorems provide analogs to these established expansions generating sums of the form $\sum_{d: (d,n)=1} f(d)$ (type I) and the Anderson-Apostol sums $\sum_{d|(m,n)} f(d) g(n/d)$ (type II) for any arithmetic functions $f$ and $g$. Our treatment of the type II sums includes a matrix-based factorization method relating the partition function $p(n)$ to arbitrary arithmetic functions $f$. We also conclude…

最大公约数的算术项表示

Arithmetic-term representations for the greatest common divisor

该研究构建了最大公约数函数的新型算术项表示，还附带推导出整数算术中用模项表示最大公约数的形式，为数论相关表示研究提供了新的构造思路。

On certain sums of arithmetic functions involving the gcd and lcm of two positive integers

We obtain asymptotic formulas with remainder terms for the hyperbolic summations $\sum_{mn\le x} f((m,n))$ and $\sum_{mn\le x} f([m,n])$, where $f$ belongs to certain classes of arithmetic functions, $(m,n)$ and $[m,n]$ denoting the gcd and lcm of the integers $m,n$. In particular, we investigate the functions $f(n)=τ(n), \log n, ω(n)$ and $Ω(n)$. We also define a common generalization of the latter three functions, and prove a corresponding result.

Generalized Greatest Common Divisors for the Orbits under Rational Functions

Assume Vojta's Conjecture. Suppose $a, b, α,β\in \mathbb{Z}$, and $f(x),g(x) \in \mathbb{Z}[x]$ are polynomials of degree $d \ge 2$. Assume that the sequence $(f^{\circ n}(a), g^{\circ n}(b))_n$ is generic and $α,β$ are not exceptional for $f,g$ respectively, we prove that for each given $\varepsilon > 0$, there exists constant $C = C(\varepsilon,a,b,α,β,f,g)>0$, such that for all $n \ge 1$, we have $$\gcd(f^{\circ n}(a)-α, g^{\circ n}(b) -β) \le C\cdot\exp({\varepsilon\cdot d^n}). $$ We prove an estimate for rational functions and for a more general gcd and then obtain the above inequality as…

分裂最大公因子的矩

The moments of split greatest common divisors

研究分裂最大公因子序列的矩，刻画了gcd(n,u_n)^λ的渐近行为，解决了代数群G_a×G_m上的矩问题，给出无条件和条件结果。

Inertia, positive definiteness and $\ell_p$ norm of GCD and LCM matrices and their unitary analogs

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 common divisor of $x_i$ and $x_j$ as its $ij$ entry. The LCM matrix $[S]_f$ is defined similarly. We consider inertia, positive definiteness and $\ell_p$ norm of GCD and LCM matrices and their unitary analogs. Proofs are based on matrix factorizations and convolutions of arithmetical functions.

A Voronoï--Oppenheim summation formula for number fields

In this note, we establish a Voronoï--Oppenheim summation formula for divisor functions over an arbitrary number field.

On sums of logarithmic averages of gcd-sum functions

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 $$\sum_{k\leq x}\frac{1}{k} \sum_{j=1}^{k}f(\gcd(k,j)) \log j.$$ More precisely, we give asymptotic formulas for various multiplicative functions such as $f=id$, $ϕ$, $id_{1+a}$ and $ϕ_{1+a}$ with $-1<a<0$. We also establish some formulas of Dirichlet series having coefficients of the sum function $\sum_{j=1}^{k}s_{k}(j)\log j$ where $s_{k}(j)$ is Anderson--Ap…

On sums of weighted averages of $\gcd$-sum functions

Let $\gcd(j,k)$ be the greatest common divisor of the integers $j$ and $k$. In this paper, we give several interesting asymptotic formulas for weighted averages of the $\gcd$-sum function $f(\gcd(j,k)) $ and the function $\sum_{d|k, d^{s}|j}(f*μ)(d) $ for any positive integers $j$ and $k$, namely $$ \sum_{k\leq x}\frac{1}{k^{r+1}}\sum_{j=1}^{k}j^{r}f(\gcd(j,k)) \quad \text{and} \quad \sum_{k\leq x}\frac{1}{k^{s(r+1)}}\sum_{j=1}^{k^s}j^{r} \sum_{\substack{d|k d^{s}|j}}(f*μ)(d), $$ with any fixed integer $s> 1$ and any arithmetical function $f$. We also establish mean value formulas for the erro…

On the probability distribution of the gcd and lcm of $r$-tuples of integers

This paper is devoted to the study of statistical properties of the greatest common divisor and the least common multiple of random samples of positive integers.

$k$维球面求和的GCD和LCM算术函数估计

Estimates for $k$-dimensional spherical summations of arithmetic functions of the GCD and LCM

研究了$k$维球面区域内涉及整数GCD和LCM算术函数的求和问题，推导了带余项的渐近公式。

涉及最大公约数的莫比乌斯（Möbius）函数求和函数

The summatory function of the Möbius function involving the greatest common divisor

本文定义了涉及最大公约数的Möbius函数求和函数$S_\mu(x)$，给出其渐近公式，在黎曼猜想假设下推导了误差项的均方估计，证明运用了Perron公式等数论工具。

Mean value estimates of gcd and lcm-sums

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 $[m,n]_b$, is the smallest $b$-th power multiple common to $m$ and $n$. We derive asymptotic formulas for the average order of the arithmetic, geometric, and harmonic means of $(m,n)_b$. Additionally, we also deduce asymptotic formulas with error terms for the means of $(n_1,n_2,\cdots, n_k)_b$, and $[n_1,n_2,\cdots, n_k]_b$ over a set of lattice points, th…

Common Divisors of Elliptic Divisibility Sequences over Function Fields

Let E/k(T) be an elliptic curve defined over a rational function field of characteristic zero. Fix a Weierstrass equation for E. For points R in E(k(T)), write x_R=A_R/D_R^2 with relatively prime polynomials A_R(T) and D_R(T) in k[T]. The sequence {D_{nR}) for n \ge 1 is called the ``elliptic divisibility sequence of R.'' Let P,Q in E(k(T)) be independent points. We conjecture that deg (gcd(D_{nP},D_{mQ})) is bounded for m,n \ge 1, and that gcd(D_{nP},D_{nQ}) = gcd(D_{P},D_{Q}) for infinitely many n \ge 1. We prove these conjectures in the case that j(E) is in k. More generally, we prove analo…

Total nonnegativity of GCD matrices and kernels

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 common divisor (GCD) matrix on $X$. By a surprising result of Beslin and Ligh [Linear Algebra and Appl. 118], all GCD matrices are positive definite. In this paper, we completely characterize the GCD matrices satisfying the stronger property of being totally nonnegative (TN) or totally positive (TP). As we show, a GCD matrix is never TP when $n \geq 3$, and is TN…

Cohen 型恒等式的特征类比及相关 Voronoi 求和公式

Character analogues of Cohen type identities and related Voronoi summation formulas

本文针对 Cohen 型恒等式给出特征类比，推导相关 Voronoi 求和公式，并证明实原特征下 L(1,χ) 的正性。

Greatest common divisors of shifted primes and Fibonacci numbers

Let $(F_n)$ be the sequence of Fibonacci numbers and, for each positive integer $k$, let $\mathcal{P}_k$ be the set of primes $p$ such that $\gcd(p - 1, F_{p - 1}) = k$. We prove that the relative density $\text{r}(\mathcal{P}_k)$ of $\mathcal{P}_k$ exists, and we give a formula for $\text{r}(\mathcal{P}_k)$ in terms of an absolutely convergent series. Furthermore, we give an effective criterion to establish if a given $k$ satisfies $\text{r}(\mathcal{P}_k) > 0$, and we provide upper and lower bounds for the counting function of the set of such $k$'s. As an application of our results, we give …

Sums of averages of gcd-sum functions II

Let $\gcd(k,j)$ denote the greatest common divisor of the integers $k$ and $j$, and let $r$ be any fixed positive integer. Define $$ M_r(x; f) := \sum_{k\leq x}\frac{1}{k^{r+1}}\sum_{j=1}^{k}j^{r}f(\gcd(j,k)) $$ for any large real number $x\geq 5$, where $f$ is any arithmetical function. Let $ϕ$, and $ψ$ denote the Euler totient and the Dedekind function, respectively. In this paper, we refine asymptotic expansions of $M_r(x; {\rm id})$, $M_r(x;ϕ)$ and $M_r(x;ψ)$. Furthermore, under the Riemann Hypothesis and the simplicity of zeros of the Riemann zeta-function, we establish the asymptotic for…

Common divisors of a^n-1 and b^n-1 over function fields

Ailon and Rudnick have shown that if $a,b \in C[T]$ are multiplicatively independent polynomials, then $°(\gcd(a^n-1,b^n-1))$ is bounded for all $n\ge1$. We show that if instead $a,b \in F[T]$ for a finite field $F$ of characteristic $p$, then $°(\gcd(a^n-1,b^n-1))$ is larger than $Cn$ for a constant $C=C(a,b)>0$ and for infinitely many $n$, even if $n$ is restricted in various reasonable ways (e.g., $gec(n,p)=1$).

Greatest common divisors of iterates of polynomials

Following work of Bugeaud, Corvaja, and Zannier for integers, Ailon and Rudnick prove that for any multiplicatively independent polynomials, $a, b \in {\mathbb C}[x]$, there is a polynomial $h$ such that for all $n$, we have \[ \gcd(a^n - 1, b^n - 1) \mid h\] We prove a compositional analog of this theorem, namely that if $f, g \in {\mathbb C}[x]$ are nonconstant compositionally independent polynomials and $c(x) \in {\mathbb C}[x]$, then there are at most finitely many $λ$ with the property that there is an $n$ such that $(x - λ)$ divides $\gcd(f^{\circ n}(x) - c(x), g^{\circ n}(x) - c(x))$.

On the greatest common divisor of $n$ and the $n$th Fibonacci number, II

Let $\mathcal{A}$ be the set of all integers of the form $\gcd(n, F_n)$, where $n$ is a positive integer and $F_n$ denotes the $n$th Fibonacci number. Leonetti and Sanna proved that $\mathcal{A}$ has natural density equal to zero, and asked for a more precise upper bound. We prove that \begin{equation*} \#\big(\mathcal{A} \cap [1, x]\big) \ll \frac{x \log \log \log x}{\log \log x} \end{equation*} for all sufficiently large $x$.

Computing dimensions of spaces of Arakelov divisors of number fields

The function $h^0$ for a number field is analogous to the dimension of the Riemann-Roch spaces at divisors on an algebraic curve. We provide a method to compute this function for number fields with unit group of rank at most 2, even with large discriminant. This method is based on using LLL-reduced bases, the "jump algorithm" and Poisson summation formula.

A generalization of Menon's identity with Dirichlet characters

The classical Menon's identity [7] states that \begin{equation*}\label{oldbegin1} \sum_{\substack{a\in\Bbb Z_n^\ast }}\gcd(a -1,n)=φ(n) σ_{0} (n), \end{equation*} where for a positive integer $n$, $\Bbb Z_n^\ast$ is the group of units of the ring $\Bbb Z_n=\Bbb Z/n\Bbb Z$, $\gcd(\ ,\ )$ represents the greatest common divisor, $φ(n)$ is the Euler's totient function and $σ_{k} (n) =\sum_{d|n } d^{k}$ is the divisor function. In this paper, we generalize Menon's identity with Dirichlet characters in the following way: \begin{equation*} \sum_{\substack{a\in\Bbb Z_n^\ast b_1, ..., b_k\in\Bbb Z_n}} …

Analogues of Euler and Poisson summation formulae

Euler--Maclaurin and Poisson analogues of the summations $\sum_{a < n \leq b} χ(n) f(n)$, $\sum_{a < n \leq b} d(n) f(n)$, $\sum_{a < n \leq b} d(n) χ(n) f(n)$ have been obtained in a unified manner, where $(χ(n))$ is a periodic complex sequence; $d(n)$ is the divisor function and $f(x)$ is a sufficiently smooth function on $[a,b]$. We also state a generalised Abel's summation formula, generalised Euler's summation formula and Euler's summation formula in several variables.

关于具有固定GCD的分数和的注记

Note on Fractional Sums with Fixed GCD

本文研究了具有固定最大公约数的分数和的渐近公式，分析了算术函数在不同整数乘积下的表示个数及其相关性质。

On the Fourier transform of the greatest common divisor

The discrete Fourier transform of the greatest common divisor is a multiplicative function that generalises both the gcd-sum function and Euler's totient function. On the one hand it is the Dirichlet convolution of the identity with Ramanujan's sum, and on the other hand it can be written as a generalised convolution product of the identity with the totient function. We show that this arithmetic function of two integers (a,m) counts the number of elements in the set of ordered pairs (i,j) such that i*j is equivalent to a modulo m. Furthermore we generalise a dozen known identities for the toti…

On the distribution of additive twists of the divisor function and Hecke eigenvalues

We obtain asymptotics with a power saving error term for $\int_0^1|\sum_{n\le X} d(n)e(nα)|^sdα$ for $s < 2$, where $d(n) = \sum_{d | n} 1$ is the divisor function. We also obtain such asymptotics for $\int_0^1|\sum_{n\le X}λ_f(n)e(nα)|^sdα$ for all $s > 0$. Our proof an iterative method with repeated applications of Jutila's variant of the circle method and Voronoi summation.

Factorization of power GCD matrices and power LCM matrices on certain gcd-closed sets

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 integers and let $S=\{x_1, \cdots, x_n\}$ be a set of $n$ distinct positive integers. We denote by $(S^a)$ (resp. $[S^a]$) the $n\times n$ matrix having the $a$th power of $(x_i,x_j)$ (resp. $[x_i,x_j]$) as its $(i,j)$-entry. For any $x\in S$, define $G_{S}(x):=\{d\in S: d<x, d|x \ {\rm and} \ (d|y|x, y\in S) \Rightarrow y\in \{d,x\}\}$. In this paper, we show th…

Bilinear sums of Kloosterman sums, multiplicative congruences and average values of the divisor function over families of arithmetic progressions

We obtain several asymptotic formulas for the sum of the divisor function $τ(n)$ with $n \le x$ in an arithmetic progressions $n \equiv a \pmod q$ on average over $a$ from a set of several consecutive elements from set of reduced residues modulo $q$ and on average over arbitrary sets. The main goal is to obtain nontrivial results for $q \ge x^{2/3}$ with the small amount of averaging over $a$. We recall that for individual values of $a$ the limit of our current methods is $q \le x^{2/3-\varepsilon}$ for an arbitrary fixed $\varepsilon> 0$. Our method builds on an approach due to Blomer (2008) …

On the greatest common divisor of $n$ and the $n$th Fibonacci number

Let $\mathcal{A}$ be the set of all integers of the form $\gcd(n, F_n)$, where $n$ is a positive integer and $F_n$ denotes the $n$th Fibonacci number. We prove that $\#\left(\mathcal{A} \cap [1, x]\right) \gg x / \log x$ for all $x \geq 2$, and that $\mathcal{A}$ has zero asymptotic density. Our proofs rely on a recent result of Cubre and Rouse which gives, for each positive integer $n$, an explicit formula for the density of primes $p$ such that $n$ divides the rank of appearance of $p$, that is, the smallest positive integer $k$ such that $p$ divides $F_k$.

涉及函数 $Ω(n)$ 和 lcm 的双曲求和

Hyperbolic summation involving the function $Ω(n)$ and lcm

本文研究了在双曲区域 $\{(a,b,c) \in \mathbb{Z}_{\geq 1}^3 : abc \leq x\}$ 上涉及素因子计数函数 $Ω(n)$ 与最小公倍数的求和 $\sum_{abc \leq x} Ω([a,b,c])$，并为其推导出了渐近公式。

Alternating sums concerning multiplicative arithmetic functions

We deduce asymptotic formulas for the alternating sums $\sum_{n\le x} (-1)^{n-1} f(n)$ and $\sum_{n\le x} (-1)^{n-1} \frac1{f(n)}$, where $f$ is one of the following classical multiplicative arithmetic functions: Euler's totient function, the Dedekind function, the sum-of-divisors function, the divisor function, the gcd-sum function. We also consider analogs of these functions, which are associated to unitary and exponential divisors, and other special functions. Some of our results improve the error terms obtained by Bordellès and Cloitre. We formulate certain open problems.

素数指数过渡几何与连续高合数之间的除数障碍

Prime-Exponent Transition Geometry and Divisor Barriers Between Consecutive Highly Composite Numbers

该研究探讨连续高合数间素数指数向量的移动问题，通过动态规划、计算机辅助枚举等方法，揭示除数障碍相关性质，发现静态边界失效情况，得到测地线容量等关键结果。

Asymptotics of arithmetic functions of GCD and LCM of random integers in hyperbolic regions

We prove limit theorems for the greatest common divisor and the least common multiple of random integers. While the case of integers uniformly distributed on a hypercube with growing size is classical, we look at the uniform distribution on sublevel sets of multivariate symmetric polynomials, which we call hyperbolic regions. Along the way of deriving our main results, we obtain some asymptotic estimates for the number of integer points in these hyperbolic domains, when their size goes to infinity.

关于gcd闭集上幂GCD和幂LCM矩阵可除性的证明

Gcd-closed sets and divisibility among power GCD matrices and power LCM matrices

本文证明了Hong猜想，即在满足特定条件的gcd闭集上，幂GCD矩阵和幂LCM矩阵在a|b时能被幂GCD矩阵整除。

On the Diophantine equation $cx^2+p^{2m}=4y^n$

Let $c$ be a square-free positive integer and $p$ a prime satisfying $p\nmid c$. Let $h(-c)$ denote the class number of the imaginary quadratic field $\mathbb{Q}(\sqrt{-c})$. In this paper, we consider the Diophantine equation $$cx^2+p^{2m}=4y^n,~~x,y\geq 1, m\geq 0, n\geq 3, \gcd(x,y)=1, \gcd(n,2h(-c))=1,$$ and we describe all its integer solutions. Our main tool here is the prominent result of Bilu, Hanrot and Voutier on existence of primitive divisors in Lehmer sequences.

Convergence of series of dilated functions and spectral norms of GCD matrices

We establish a connection between the $L^2$ norm of sums of dilated functions whose $j$th Fourier coefficients are $\mathcal{O}(j^{-α})$ for some $α\in (1/2,1)$, and the spectral norms of certain greatest common divisor (GCD) matrices. Utilizing recent bounds for these spectral norms, we obtain sharp conditions for the convergence in $L^2$ and for the almost everywhere convergence of series of dilated functions.

关于一个平滑的Walfisz除数问题

On a Smoothed Walfisz Divisor Problem

用除数函数σ替换Dirichlet除数函数τ，研究平滑Dirichlet除数问题，证明σ(n)加权和的显式渐近公式，从而消除经典平均阶中的困难部分，并推导Walfisz除数问题中误差项积分的收敛性。

广义除数函数 $σ_{z}^{(k)}(n)$ 的 Voronoi 求和公式

Voronoi summation formula for the generalized divisor function $σ_{z}^{(k)}(n)$

本文研究广义除数函数 $σ_{z}^{(k)}(n)$，在其 Dirichlet 级数不落入经典多 gamma 因子 Hecke 函数方程理论的情况下，建立显式 Voronoï 求和公式，并分析新型 Bessel 型核及其关键关系。

计算 $N^{9/28+o(1)}$ 时间内的除数求和函数

Computing the divisor summatory function in $N^{9/28+o(1)}$

提出一种解析算法，通过 Voronoï 求和加速指数和计算，在 $N^{9/28+o(1)}$ 期望时间内计算除数求和函数孤立值，优于现有 $O(N^{1/3})$ 方法。

GCD of sums of $k$ consecutive squares of generalized Fibonacci numbers

In 2021, Guyer and Mbirika gave two equivalent formulas that computed the greatest common divisor (GCD) of all 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 this current paper, we extend their results to the GCD of all sums of $k$ consecutive squares of these numbers. Denoting these GCD values by the symbol $\mathcal{G}_{G_0, G_1}^2\!(k)$, we prove $\mathcal{G}_{G_0, G_1}^2\!(k) = \gcd\left(G_k G_{k+1} - G_0 G_1,\; G_{k+1}…

Karatsuba 除数问题及相关问题

Karatsuba's divisor problem and related questions

本文证明了关于素数减一及平方数加一的除数函数倒数和的两个渐近公式，解决了 Karatsuba 除数问题及相关问题。

某些二项式系数的最大公约数判据

A Greatest Common Divisor Criterion of Certain Binomial Coefficients

证明OEIS A080170中的二项式系数最大公约数判据，该判据等价于n/P > P，其中n=k+1，P是整除n的最大素幂。

On the asymptotic formulae for some multiplicative functions in short intervals

In this paper we prove the mean values of some multiplicative functions connected with the divisor function on the short interval of summation.

Number field analogue of divisor function à la Koshliakov

In this article, we study a divisor function in an arbitrary number field akin to Koshliakov's work on Vorono\"{\dotlessi} summation formula. More precisely, we generalize Koshliakov's kernel and Koshliakov's transform over any number field to obtain identities for the Lambert series associated to the divisor function in an arbitrary number field.

Primitive divisors of elliptic divisibility sequences over function fields with constant j-invariant

We prove an optimal Zsigmondy bound for elliptic divisibility sequences over function fields in case the $j$-invariant of the elliptic curve is constant. In more detail, given an elliptic curve $E$ with a point $P$ of infinite order, the sequence $D_1$, $D_2, \ldots$ of denominators of multiples $P$, $2P,\ldots$ of $P$ is a strong divisibility sequence in the sense that $\gcd(D_m, D_n) = D_{\gcd(m,n)}$. This is the genus-one analogue of the genus-zero Fibonacci, Lucas and Lehmer sequences. A number $N$ is called a Zsigmondy bound of the sequence if each term $D_{n}$ with $n>N$ presents a new p…

On the mean values of some multiplicative functions on the short interval

In this paper we study the mean values of some multiplicative functions connected with the divisor function on the short interval of summation. The asymptocic values for such mean values are proved.

Divisor Goldbach Conjecture and its Partition Number

Based on the Goldbach conjecture and arithmetic fundamental theorem, the Goldbach conjecture was extended to more general situations, i.e., any positive integer can be written as summation of some specific prime numbers, which depends on the divisible factor of this integer, that is: For any positive integer $n~(n>2)$, if there exists an integer $m$, such that $m|n~( 1 < m < n )$, then $n=\sum_{i=1}^m p_i $, where $ p_i~(i=1,2 ,3...m)$ is prime number. In addition, for more prime summands, the combinatorial counting is also discussed. For some special cases, some brief proofs are given. By the…