✦ LIBER ✦

A Simple Proof and Extensions of an Inequality

✍ Scribed by Young-Ho Kim

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 45 KB
Volume: 245
Category: Article
ISSN: 0022-247X
DOI: 10.1006/jmaa.2000.6743

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Refinements and Extensions of an Inequal

Refinements and Extensions of an Inequality

✍ Young-Ho Kim 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 54 KB

In this article, using the properties of the power mean, the author proves the inequality ' 1 2 2 valid for any two nonnegative quantities a and a . We shall begin our 1 2 consideration of results which are not as immediately apparent by dis-

Refinements and Extensions of an Inequal

Refinements and Extensions of an Inequality, III

✍ Josip Pečarić; Feng Qi; V Šimić; Sen-Lin Xu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 142 KB

Refinements and Extensions of an Inequal

Refinements and Extensions of an Inequality, II

✍ Qi Feng; Xu Senlin 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 124 KB

Remark on Refinements and Extensions of

Remark on Refinements and Extensions of an Inequality

✍ Zheng Liu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 49 KB

An Extension of Carlson's Inequality

✍ Kuang Jichang; Lokenath Debnath 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 64 KB

An extension of Carlson's inequality is made by using the Euler-Maclaurin summation formula. The integral analogues of this inequality are also presented.  2002 Elsevier Science (USA)

An extension of Janson's inequality

✍ Małgorzata Roos 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 521 KB

## An upper bound for P[W=O], where W is a sum of indicator variables with a special structure, which appears, for example, in subgraph counts in random graphs, is derived. Furthermore, its applications to a problem of k-runs and a random graph problem are given. The result is a generalization and