2009
DOI: 10.7153/jmi-03-24
|View full text |Cite
|
Sign up to set email alerts
|

About Bergström's inequality

Abstract: Abstract. In this paper, we generalize identity (3), from where we obtain a rafinement of inequalities (1) and (2). IntroductionThe inequality from Theorem 1 is called in the literature Bergström's inequality (see [2]with equality if and only ifThe generalization of Bergström's inequality is contained in the following theorem (see [5]). THEOREM 2. If x k ∈ R and a k > 0 , k ∈ {1, 2,...,n} , thenBy particularizations in Theorem 2, in paper [5] the refinements are obtained of Cauchy-Schwarz's inequality.For the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
13
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(13 citation statements)
references
References 4 publications
0
13
0
Order By: Relevance
“…for any n ≥ 2, with equality if and only if the sequences a and b are proportional. In [5], Pop showed an improvement of inequality (2). Two consequences can be obtained from above inequality, namely: for arbitrary sequence a = (a 1 , a 2 , .…”
Section: Introductionmentioning
confidence: 99%
“…for any n ≥ 2, with equality if and only if the sequences a and b are proportional. In [5], Pop showed an improvement of inequality (2). Two consequences can be obtained from above inequality, namely: for arbitrary sequence a = (a 1 , a 2 , .…”
Section: Introductionmentioning
confidence: 99%
“…Bergström inequality has stimulated several mathematicians' interest, and various extensions, refinements, and proofs of the inequality have been provided. We refer to [7,9,14,17,28,29] and the references given therein.…”
Section: Introductionmentioning
confidence: 99%
“…If x i ∈ R + then a particularization of a theorem given in [10] can be formulated as below and will be used in next section. Theorem 1.…”
Section: Introductionmentioning
confidence: 99%
“…Theorem 1. ( [10]) If n ∈ N, n ≥ 2, x 1 , x 2 , ..., x n ∈ R + , and a 1 , a 2 , ..., a n ∈ R \ {0} with a 1 + a 2 + ... + a n = 0 then, (a i x j − a j x i ) 2 a i a j .…”
Section: Introductionmentioning
confidence: 99%