Zhen Guo

Prof. Zhen Guo

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2024 in AIMS Mathematics
Verified
Journal Article
Open access
PDF file
ZGZhen Guo
Zhen Guo
Let $ \tau(n) $ be the Dirichlet divisor function and $ k\geqslant2 $ be a fixed integer. We give an asymptotic formula of the mean square of \begin{document}$ \begin{equation*} \Delta_k(x) = \sum\limits_{n_1, \cdots, n_k\leqslant x}\tau(n_1 \cdots n_k)-x^kP_k(\log x). \end{equation*} $\end{document}

6 February 2025 in Indian Journal of Pure and Applied Mathematics
Verified
Journal Article
Closed access
PDF file
ZGZhen Guo
Zhen Guo

22 May 2026 in Indagationes Mathematicae
Verified
Journal Article
Closed access
ZGZhen Guo
Zhen Guo
JLJinjiang Li
Jinjiang Li
LLLinji Long
Linji Long
MZMin Zhang
Min Zhang

6 January 2025 in Symmetry
Verified
Journal Article
Open access
PDF file
ZGZhen Guo
Zhen Guo
Let x be a large real number, d(n) be the Dirichlet divisor function and Δ(x)=∑n⩽xd(n)−xlogx−(2γ−1)x. In this paper, we consider a weighted form of the three primes theorem: S(N;k1,k2,k3):=∑p1+p2+p3=NΔk1(p1)Δk2(p2)Δk3(p3), where p1,p2,p3 run over primes, k1,k2,k3∈{1,2,⋯,9}, and N is an large odd integer. For the case ki∈{2,3,⋯,9}(i=1,2,3), the others two kj∈{2,3,4} with j≠i, an asymptotic formula for S(N;k1,k2,k3) has been derived, along with a non-trivial upper bound estimate for S(N;k1,k2,k3) when min(k1,k2,k3)=1.

1 October 2024 in arXiv
Verified
Preprint
Open access
PDF file
ZGZhen Guo
Zhen Guo
XLXin Li
Xin Li
Let $d(n)$ be the Dirichlet divisor function and $Δ(x)$ denote the error term of the sum $\sum_{n\leqslant x}d(n)$ for a large real variable $x$. In this paper we focus on the sum $\sum_{p\leqslant x}Δ^2(p)$, where $p$ runs over primes. We prove that there exists an asymptotic formula.

11 November 2024 in arXiv
Verified
Preprint
Open access
PDF file
ZGZhen Guo
Zhen Guo
XLXin Li
Xin Li
Suppose $k\geqslant3$ is an integer. Let $τ_k(n)$ be the number of ways $n$ can be written as a product of $k$ fixed factors. For any fixed integer $r\geqslant2$, we have the asymptotic formula \begin{equation*} \sum_{n_1,\cdots,n_r\leqslant x}τ_k(n_1 \cdots n_r)=x^r\sum_{\ell=0}^{r(k-1)}d_{r,k,\ell}(\log x)^{\ell}+O(x^{r-1+α_k+\varepsilon}), \end{equation*} where $d_{r,k,\ell}$ and $0<α_k<1$ are computable constants. In this paper we study the mean square of $Δ_{r,k}(x)$ and give upper bounds for $k\geqslant4$ and an asymptotic formula for the mean square of $Δ_{r,3}(x)$. We also get an upper bound for the third power moment of $Δ_{r,3}(x)$. Moreover, we study the first power moment of $Δ_{r,3}(x)$ and then give a result for the sign changes of it.