SearcharxivSearch

arXiv · 2209.02585

Inequalities in calculus: methods of prooving results and problem solving

Abstract

This preprint is a text for students and teachers on inequalities. Some standard topics are covered on application of calculus to inequality proving. Many examples are considered, stated, solved or partially solved. Some problems are standard, but some are rare, new and original. The next topics are considered with many examples: monotonicity of functions, Lagrange theorem and inequalities proving, estimating of finite sums, inequalities of Schl\"omilch-LeMonnier type, proof of inequalities by method of mathematical induction, inequalities for the number $e$, exponentials, logarithmic and similar functions, some means and their inequalities, Cauchy-Bunyakovskii, Minkovskii, Young, H\"older (Rogers-H\"older-Riesz !) inequalities and some of their improvements and generalisations. Some new results include inequalities on exponentials, logarithmic and similar functions, generalisations of Cauchy--Bunyakovskii and Young inequalities, some mean inequalities including mean inequalities on the complex domain and more.

Explore related subjects

Keep this discovery

BibTeXRIS

Sergei Sitnik, Elina Shishkina, Lidiya Kovaleva, Olga Chernova. 2022-08-02. Inequalities in calculus: methods of prooving results and problem solving. https://arxiv.org/abs/2209.02585

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO