• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.101-109
• /
• 2011

The Riemann's zeta function $\zeta(s)$ has been known as answer for a number of primes $\pi$(x) less than given number x. In prime number theorem, there are another approximation function $\frac{x}{lnx}$,Li(x), and R(x). The error about $\pi$(x) is R(x) < Li(x) < $\frac{x}{lnx}$. The logarithmic integral function is Li(x) = $\int_{2}^{x}\frac{1}{lnt}dt$ ~ $\frac{x}{lnx}\sum\limits_{k=0}^{\infty}\frac{k!}{(lnx)^k}=\frac{x}{lnx}(1+\frac{1!}{(lnx)^1}+\frac{2!}{(lnx)^2}+\cdots)$. This paper shows that the $\pi$(x) can be represent with finite Li(x), and presents generalized prime counting function $\sqrt{{\alpha}x}{\pm}{\beta}$. Firstly, the $\pi$(x) can be represent to $Li_3(x)=\frac{x}{lnx}(\sum\limits_{t=0}^{{\alpha}}\frac{k!}{(lnx)^k}{\pm}{\beta})$ and $Li_4(x)=\lfloor\frac{x}{lnx}(1+{\alpha}\frac{k!}{(lnx)^k}{\pm}{\beta})}k\geq2$ such that $0{\leq}t{\leq}2k$. Then, $Li_3$(x) is adjusted by $\pi(x){\simeq}Li_3(x)$ with ${\alpha}$ and error compensation value ${\beta}$. As a results, this paper get the $Li_3(x)=Li_4(x)=\pi(x)$ for $x=10^k$. Then, this paper suggests a generalized function $\pi(x)=\sqrt{{\alpha}x}{\pm}{\beta}$. The $\pi(x)=\sqrt{{\alpha}x}{\pm}{\beta}$ function superior than Riemann's zeta function in representation of prime counting.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.3
• /
• pp.395-402
• /
• 2003

The capacity of a CDMA cellular system is determined by the amount of interference, therefore the exact estimation of interference is important to evaluate the system performance. In this paper, we propose an approximated equation which calculates reverse link other cell interference in the CDMA cellular systems. The equation using Riemann-Zeta function has a property that it is useful in case of any radio propagation loss exponents. And we compare calculation results with simulation results in other to verify it's usefulness. The upper bound of system capacity calculated with the proposed approximated equation gives almost alike result with the simulation. The proposed interference bound is useful to calculate system capacity and to evaluate some algorithm in a hierarchical cellular system which must be considered various propagation exponents.

• Journal of the Korean Mathematical Society
• /
• v.56 no.6
• /
• pp.1599-1611
• /
• 2019

Let $m,n{\in}{\mathbb{N}}$. We represent the additive subgroups of the ring ${\mathbb{Z}}_m{\times}{\mathbb{Z}}_n$, which are also (unital) subrings, and deduce explicit formulas for $N^{(s)}(m,n)$ and $N^{(us)}(m,n)$, denoting the number of subrings of the ring ${\mathbb{Z}}_m{\times}{\mathbb{Z}}_n$ and its unital subrings, respectively. We show that the functions $(m,n){\mapsto}N^{u,s}(m,n)$ and $(m,n){\mapsto}N^{(us)}(m,n)$ are multiplicative, viewed as functions of two variables, and their Dirichlet series can be expressed in terms of the Riemann zeta function. We also establish an asymptotic formula for the sum $\sum_{m,n{\leq}x}N^{(s)}(m,n)$, the error term of which is closely related to the Dirichlet divisor problem.