<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Inequalities on Aurélien&#39;s Math Notebook</title>
    <link>https://math.aurelienooms.be/tags/inequalities/</link>
    <description>Recent content in Inequalities on Aurélien&#39;s Math Notebook</description>
    <generator>Hugo -- gohugo.io</generator>
    <lastBuildDate>Sun, 23 Jul 2017 00:00:00 +0000</lastBuildDate><atom:link href="https://math.aurelienooms.be/tags/inequalities/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Sums of geometric series</title>
      <link>https://math.aurelienooms.be/2017/07/23/sums-of-geometric-series/</link>
      <pubDate>Sun, 23 Jul 2017 00:00:00 +0000</pubDate>
      
      <guid>https://math.aurelienooms.be/2017/07/23/sums-of-geometric-series/</guid>
      <description>&lt;p&gt;Among the identities that are useful in the analysis of algorithms,
this one shows how sums of geometric series converge when the ratio
is smaller than one (in absolute value). It occurs in divide an conquer
schemes. For example, it allows to show that hierarchical cuttings for \(n\)
hyperplanes in \(d\) dimensions only need space proportional to \(n^d\).&lt;/p&gt;
&lt;p&gt;\[
\sum_{i=0}^{\infty} \binom{i+j}{j} x^i = \frac{1}{ {(1-x)}^{j+1} },
\forall j \in \mathbb{N}, \forall x \in (-1,1).
\]&lt;/p&gt;</description>
    </item>
    
    <item>
      <title>Log Log Log</title>
      <link>https://math.aurelienooms.be/2016/04/14/log-log-log/</link>
      <pubDate>Thu, 14 Apr 2016 00:00:00 +0000</pubDate>
      
      <guid>https://math.aurelienooms.be/2016/04/14/log-log-log/</guid>
      <description>&lt;h2 id=&#34;theorem&#34;&gt;Theorem&lt;/h2&gt;
&lt;p&gt;$$
\frac{\log n}{\log \log n}! = \Theta(n)
$$&lt;/p&gt;</description>
    </item>
    
  </channel>
</rss>
