• East Asian mathematical journal
• /
• v.29 no.5
• /
• pp.545-550
• /
• 2013

A remarkably large number of integral formulas have been investigated and developed. Certain large number of integral formulas are expressed as derivatives of some known functions. Here we choose to recall such a formula to present explicit expressions in terms of Gamma function, Psi function and Polygamma functions. Some simple interesting special cases of our main formulas are also considered. It is also pointed out that the same argument can establish explicit integral formulas for other those expressed in terms of derivatives of some known functions.

• Honam Mathematical Journal
• /
• v.35 no.4
• /
• pp.639-645
• /
• 2013

We aim at presenting certain integral representations for the Riemann Zeta function ${\zeta}(s)$ at positive integer arguments by using some known integral representations of log ${\Gamma}(1+z)$ and ${\psi}(1+z)$.

• Korean Journal of Mathematics
• /
• v.28 no.2
• /
• pp.361-378
• /
• 2020

The most apparent aspect of the present study is to introduce a new sequence space 𝚽^⋆(𝓛_p) derived by double Euler-Totient matrix operator. We examine its topological and algebraic properties and give an inclusion relation. In addition to those, the α-, β(bp)- and γ-duals of the space 𝚽^⋆(𝓛_p) are determined and finally, some 4-dimensional matrix mapping classes related to this space are characterized.

• Journal of the Chungcheong Mathematical Society
• /
• v.22 no.3
• /
• pp.467-480
• /
• 2009

In 1859, Bernhard Riemann, in his epoch-making memoir, extended the Euler zeta function $\zeta$(s) (s > 1; $s{\in}\mathbb{R}$) to the Riemann zeta function $\zeta$(s) ($\Re$(s) > 1; $s{\in}\mathbb{C}$) to investigate the pattern of the primes. Sine the time of Euler and then Riemann, the Riemann zeta function $\zeta$(s) has involved and appeared in a variety of mathematical research subjects as well as the function itself has been being broadly and deeply researched. Among those things, we choose to make a further investigation of the following subjects: Evaluation of $\zeta$(2k) ($k {\in}\mathbb{N}$); Approximate functional equations for $\zeta$(s); Series involving the Riemann zeta function.

• Communications of the Korean Mathematical Society
• /
• v.29 no.2
• /
• pp.239-255
• /
• 2014

We develop a set of identities for Euler type sums. In particular we investigate products of shifted harmonic numbers of order two and reciprocal binomial coefficients.

• Journal of the Korean Mathematical Society
• /
• v.59 no.2
• /
• pp.299-309
• /
• 2022

Let k ⩾ 2 be an integer, S^k = {1^k, 2^k, 3^k, …} and B = {b₁, b₂, b₃, …} be an additive complement of S^k, which means all sufficiently large integers can be written as the sum of an element of S^k and an element of B. In this paper we prove that $${{\lim}\;{\sup}}\limits_{n{\rightarrow}{\infty}}\;{\frac{{\Gamma}(2-{\frac{1}{k}})^{\frac{k}{k-1}}{\Gamma}(1+{\frac{1}{k}})^{\frac{k}{k-1}}n^{\frac{k}{k-1}}-b_n}{n}}\;{\geqslant}\;{\frac{k}{2(k-1)}}\;{\frac{{\Gamma}(2-{\frac{1}{k}})^2}{{\Gamma}(2-{\frac{2}{k}})}},$$ where 𝚪(·) is Euler's Gamma function.

• Communications of the Korean Mathematical Society
• /
• v.26 no.4
• /
• pp.709-720
• /
• 2011

We obtain special type of differential equations which their solution are random variable with known continuous density function. Stochastic differential equations (SDE) of continuous distributions are determined by the Fokker-Planck theorem. We approximate solution of differential equation with numerical methods such as: the Euler-Maruyama and ten stages explicit Runge-Kutta method, and analysis error prediction statistically. Numerical results, show the performance of the Rung-Kutta method with respect to the Euler-Maruyama. The exponential two parameters, exponential, normal, uniform, beta, gamma and Parreto distributions are considered in this paper.

• Honam Mathematical Journal
• /
• v.35 no.2
• /
• pp.137-146
• /
• 2013

Motivated essentially by their potential for applications in a wide range of mathematical and physical problems, the log-sine and log-cosine integrals have been evaluated, in the existing literature on the subject, in many different ways. The main object of this paper is to present explicit evaluations of some families of log-sine and log-cosine integrals by making use of the familiar Beta function.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.6
• /
• pp.1651-1672
• /
• 2023

In 2010, Li-Ye [13, Theorem 0.1] proved that P(ζ(z), ζ'(z), . . . , ζ^(m)(z), Γ(z), Γ'(z), Γ"(z)) ≢ 0 in ℂ, where m is a non-negative integer, and P(u₀, u₁, . . . , u_m, v₀, v₁, v₂) is any non-trivial polynomial in its arguments with coefficients in the field ℂ. Later on, Li-Ye [15, Theorem 1] proved that P(z, Γ(z), Γ'(z), . . . , Γ⁽ⁿ⁾(z), ζ(z)) ≢ 0 in z ∈ ℂ for any non-trivial distinguished polynomial P(z, u₀, u₁, . . ., u_n, v) with coefficients in a set L_δ of the zero function and a class of nonzero functions f from ℂ to ℂ ∪ {∞} (cf. [15, Definition 1]). In this paper, we prove that P(z, ζ(z), ζ'(z), . . . , ζ^(m)(z), Γ(z), Γ'(z), . . . , Γ⁽ⁿ⁾(z)) ≢ 0 in z ∈ ℂ, where m and n are two non-negative integers, and P(z, u₀, u₁, . . . , u_m, v₀, v₁, . . . , v_n) is any non-trivial polynomial in the m + n + 2 variables u₀, u₁, . . . , u_m, v₀, v₁, . . . , v_n with coefficients being meromorphic functions of order less than one, and the polynomial P(z, u₀, u₁, . . . , u_m, v₀, v₁, . . . , v_n) is a distinguished polynomial in the n + 1 variables v₀, v₁, . . . , v_n. The question studied in this paper is concerning the conjecture of Markus from [16]. The main results obtained in this paper also extend the corresponding results from Li-Ye [12] and improve the corresponding results from Chen-Wang [5] and Wang-Li-Liu-Li [23], respectively.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.8
• /
• pp.29-33
• /
• 2015

This paper proposes a discrete logarithm algorithm that remarkably reduces the execution time of Pollard's Rho algorithm. Pollard's Rho algorithm computes congruence or collision of ${\alpha}^a{\beta}^b{\equiv}{\alpha}^A{\beta}^B$ (modp) from the initial value a = b = 0, only to derive ${\gamma}$ from $(a+b{\gamma})=(A+B{\gamma})$, ${\gamma}(B-b)=(a-A)$. The basic Pollard's Rho algorithm computes $x_i=(x_{i-1})^2,{\alpha}x_{i-1},{\beta}x_{i-1}$ given ${\alpha}^a{\beta}^b{\equiv}x$(modp), and the general algorithm computes $x_i=(x_{i-1})^2$, $Mx_{i-1}$, $Nx_{i-1}$ for randomly selected $M={\alpha}^m$, $N={\beta}^n$. This paper proposes 4-model Pollard Rho algorithm that seeks ${\beta}_{\gamma}={\alpha}^{\gamma},{\beta}_{\gamma}={\alpha}^{(p-1)/2+{\gamma}}$, and ${\beta}_{{\gamma}^{-1}}={\alpha}^{(p-1)-{\gamma}}$) from $m=n={\lceil}{\sqrt{n}{\rceil}$, (a,b) = (0,0), (1,1). The proposed algorithm has proven to improve the performance of the (0,0)-basic Pollard's Rho algorithm by 71.70%.