A classical result of Khinchin says that for almost all real numbers α, the geometric mean of the first n digits ai(α) in the continued fraction expansion of α converges to a number K ≈ 2.6854520 . . . (Khinchin’s constant) as n → ∞. On the other hand, for almost all α, the arithmetic mean of the first n continued fraction digits ai(α) approaches infinity as n → ∞. There is a sequence of refine...

Recently, S.S. Dragomir used the concavity property of the log mapping and the weighted arithmetic mean-geometric mean inequality to develop new inequalities that were then applied to Information Theory. Here we extend these inequalities and their applications.

We produce exact cubic analogues of Jacobi's celebrated theta function identity and of the arithmetic-geometric mean iteration of Gauss and Legendre. The iteration in question is

The total version of geometric–arithmetic index of graphs is introduced based on the endvertex degrees of edges of their total graphs. In this paper, beside of computing the total GA index for some graphs, its some properties especially lower and upper bounds are obtained.

For a,b > 0 with a = b , let P = (a− b)/(4arctana/b−π) , A = (a+ b)/2 , G = √ ab denote the Seiffert mean, arithmetic mean, geometric mean of a and b , respectively. In this paper, we present new sharp bounds for Seiffert P in terms of weighted power means of arithmetic mean A and geometric mean G : ( 2 3 A p1 + 3 G p1 )1/p1 < P < ( 2 3 A p2 + 3 G p2 )1/p2 , where p1 = 4/5 and p2 = logπ/2 (3/2)...

We give a simpler proof of a result of Holland concerning a mixed arithmetic-geometric mean inequality. We also prove a result of mixed mean inequality involving the symmetric means.

let g be a graph. in this paper, we study the eccentric connectivity index, the new version ofthe second zagreb index and the forth geometric–arithmetic index.. the basic properties ofthese novel graph descriptors and some inequalities for them are established.