摘要：In this paper, we demonstrate that are strictly convex on (0,+∞) for all n = 1,3,..., and there exists a unique global minimum x n of ∆ n (x) for each odd positive integer n. On the other hand, we develop the algorithm for calculating the global minimum or the zero point of ∆ n (x) based on the Newton’s method and the recurrence relation of Γ (n) (x) associated with the Digamma function, the numerical results show that it’s more effective than other two algorithms. Furthermore, we find that ∆ n (x n ) is strictly increasing and ∆ n (x n ) ? α = 0.6359.
