<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Math for the People</title>
    <link>https://mathforthepeople.com/</link>
    <description>A stripped-down blog about mathematics.</description>
    <language>en</language>
    <lastBuildDate>Mon, 18 May 2026 16:26:34 +0000</lastBuildDate>
    <item>
      <title>What are numbers and how do they work?</title>
      <link>https://mathforthepeople.com/numbers-how/</link>
      <guid isPermaLink="true">https://mathforthepeople.com/numbers-how/</guid>
      <pubDate>Thu, 14 May 2026 00:00:00 +0000</pubDate>
      <author>Joe</author>
      <description><![CDATA[<p>For most of us, our first exposure to mathematics is counting. How many of the thing do I have? How many minutes do I have to play? I don&rsquo;t want four grapes, I want five. We&rsquo;re born with an inherent sense of quantity. We know when something is big. We can visually assess when there is more or less of something. That&rsquo;s <em>quantity</em>. There is a difference between quantity and numbers. Numbers are things that we use to describe quantities.<sup id="fnref:1"><a class="footnote-ref" href="#fn:1">1</a></sup> Don&rsquo;t get me wrong. Using number to describe a physical quantity is immensely useful, but things really become interesting when you learn to separate the two ideas entirely.</p>
<h2 id="the-natural-numbers-and-counting">The Natural Numbers and Counting</h2>
<p>Let us begin at the beginning. The natural numbers, denoted by <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>&#x02115;</mi></mrow></math>, or whole numbers: 0, 1, 2, 3, and so on.<sup id="fnref:2"><a class="footnote-ref" href="#fn:2">2</a></sup> The natural numbers have many nice properties. My favorite is closure under addition. We say a set <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>&#x1D412;</mi></mrow></math> is closed under addition if for any <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msub><mi>n</mi><mn>1</mn></msub><mo>&#x0002C;</mo><msub><mi>n</mi><mn>2</mn></msub><mo>&#x02208;</mo><mi>&#x02115;</mi></mrow></math> then the sum, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msub><mi>n</mi><mn>1</mn></msub><mo>&#x0002B;</mo><msub><mi>n</mi><mn>2</mn></msub></mrow></math>, is also a natural number.</p>
<p>It&rsquo;s convenient to include 0 in the natural numbers because it is the <em>additive identity</em>. That means <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>n</mi><mo>&#x0002B;</mo><mn>0</mn><mo>&#x0003D;</mo><mi>n</mi></mrow></math> for every <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>n</mi><mo>&#x02208;</mo><mi>&#x02115;</mi></mrow></math>, adding 0 to another number.</p>
<h2 id="the-integers-addition-and-subtraction">The Integers, Addition, and Subtraction</h2>
<p>Now, what if we combine this notion of additive identity and closure under addition? What are the natural numbers, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msub><mi>n</mi><mn>1</mn></msub><mo>&#x0002C;</mo><msub><mi>n</mi><mn>2</mn></msub></mrow></math> that satisfy the equation <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msub><mi>n</mi><mn>1</mn></msub><mo>&#x0002B;</mo><msub><mi>n</mi><mn>2</mn></msub><mo>&#x0003D;</mo><mn>0</mn></mrow></math>? Trivially, we see that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msub><mi>n</mi><mn>1</mn></msub><mo>&#x0003D;</mo><msub><mi>n</mi><mn>2</mn></msub><mo>&#x0003D;</mo><mn>0</mn></mrow></math>, is a solution. But are there any others? Suppose <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msub><mi>n</mi><mn>1</mn></msub><mo>&#x0003D;</mo><mn>6781123496789</mn></mrow></math>, that&rsquo;s a natural number. Does there exist a natural number <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msub><mi>n</mi><mn>2</mn></msub></mrow></math> such that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mn>6781123496789</mn><mo>&#x0002B;</mo><msub><mi>n</mi><mn>2</mn></msub><mo>&#x0003D;</mo><mn>0</mn></mrow></math>? No. You need negative numbers to do this, which is impossible if you can&rsquo;t divorce the notion of quantity from number. This actually <a href="https://en.wikipedia.org/wiki/Negative_number#History">happened</a>. Solutions that involved negative numbers were considered false or absurd.</p>
<p>At some point some nerd decided that it might be useful to consider what negative numbers might have to offer us. Thus, the integers, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>&#x02124;</mi></mrow></math>, showed up.<sup id="fnref:4"><a class="footnote-ref" href="#fn:4">4</a></sup> The integers have the property that for any <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>z</mi><mo>&#x02208;</mo><mi>&#x02124;</mi></mrow></math> there exists a <em>unique</em> <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msub><mi>z</mi><mo>&#x0002A;</mo></msub><mo>&#x02208;</mo><mi>&#x02124;</mi></mrow></math> such that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>z</mi><mo>&#x0002B;</mo><msub><mi>z</mi><mo>&#x0002A;</mo></msub><mo>&#x0003D;</mo><mn>0</mn><mo>&#x0002E;</mo></mrow></math> When this happens, we say that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msub><mi>z</mi><mo>&#x0002A;</mo></msub></mrow></math> is the <em>additive inverse</em> of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>z</mi><mo>&#x0002E;</mo></mrow></math> It should be pretty clear that the natural numbers are a subset of the integers. We denote this by <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>&#x02115;</mi><mo>&#x02282;</mo><mi>&#x02124;</mi></mrow></math>.</p>
<p>Notice that we haven&rsquo;t mentioned subtraction once. We are thinking purely in terms of addition. It is tempting to think about subtraction as addition of a negative number. It is not. <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>a</mi><mo>&#x0002B;</mo><mo stretchy="false">&#x00028;</mo><mo>&#x02212;</mo><mi>b</mi><mo stretchy="false">&#x00029;</mo><mo>&#x0003D;</mo><mo stretchy="false">&#x00028;</mo><mo>&#x02212;</mo><mi>b</mi><mo stretchy="false">&#x00029;</mo><mo>&#x0002B;</mo><mi>a</mi></mrow></math>. That is true because addition commutes. It is not true that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>a</mi><mo>&#x02212;</mo><mi>b</mi><mo>&#x0003D;</mo><mi>b</mi><mo>&#x02212;</mo><mi>a</mi></mrow></math>. Subtraction does not commute.</p>
<h2 id="the-rational-numbers-multiplication-and-division">The Rational Numbers, Multiplication, and Division</h2>
<p>The rational numbers arise from the integers when you ask the same question about multiplication as we did addition.<sup id="fnref:3"><a class="footnote-ref" href="#fn:3">3</a></sup> It&rsquo;s pretty clear that for any two integers <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msub><mi>z</mi><mn>1</mn></msub><mo>&#x0002C;</mo><msub><mi>z</mi><mn>2</mn></msub><mo>&#x02208;</mo><mi>&#x02124;</mi></mrow></math> that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msub><mi>z</mi><mn>1</mn></msub><mo>&#x000B7;</mo><msub><mi>z</mi><mn>2</mn></msub><mo>&#x02208;</mo><mi>&#x02124;</mi><mo>&#x0002E;</mo></mrow></math> It&rsquo;s also pretty clear that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>z</mi><mo>&#x000B7;</mo><mn>1</mn><mo>&#x0003D;</mo><mi>z</mi></mrow></math> for every <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>z</mi><mo>&#x02208;</mo><mi>&#x02124;</mi></mrow></math>. This makes 1 the <em>multiplicative identity</em>.</p>
<p>Now we ask ourselves for a given <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>z</mi><mo>&#x02208;</mo><mi>&#x02124;</mi></mrow></math>, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>z</mi><mo>&#x02260;</mo><mn>0</mn></mrow></math>, does there exist a unique <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msub><mi>z</mi><mo>&#x0002A;</mo></msub></mrow></math> such that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>z</mi><mo>&#x000B7;</mo><msub><mi>z</mi><mo>&#x0002A;</mo></msub><mo>&#x0003D;</mo><mn>1</mn><mo>&#x0003F;</mo></mrow></math> If such a <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msub><mi>z</mi><mo>&#x0002A;</mo></msub></mrow></math> exists, we say it is the <em>multiplicative inverse</em> of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>z</mi></mrow></math>. It&rsquo;s true for 1 and -1, but what the remaining integers? How do we know this?</p>
<p>Since <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>z</mi><mo>&#x02260;</mo><mn>0</mn></mrow></math>, we know that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mo stretchy="false">&#x0007C;</mo><mi>z</mi><mo stretchy="false">&#x0007C;</mo><mo>&#x0003E;</mo><mn>0</mn></mrow></math>. We can assume, without loss of generality, that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>z</mi><mo>&#x0003E;</mo><mn>1</mn><mo>&#x0002E;</mo></mrow></math> Well, since <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>z</mi><mo>&#x0003E;</mo><mn>1</mn></mrow></math> it must be the case that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msub><mi>z</mi><mo>&#x0002A;</mo></msub><mo>&#x0003D;</mo><mstyle displaystyle="false" scriptlevel="0"><mfrac><mrow><mn>1</mn></mrow><mrow><mi>z</mi></mrow></mfrac></mstyle><mo>&#x0003C;</mo><mn>1</mn></mrow></math>. Since <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>z</mi><mo>&#x0003E;</mo><mn>0</mn></mrow></math>, we also know that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msub><mi>z</mi><mo>&#x0002A;</mo></msub><mo>&#x0003E;</mo><mn>0</mn></mrow></math>. Thus, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mn>0</mn><mo>&#x0003C;</mo><msub><mi>z</mi><mo>&#x0002A;</mo></msub><mo>&#x0003C;</mo><mn>1</mn></mrow></math>. Uh oh, there aren&rsquo;t any integers in between 0 and 1. We&rsquo;re going to need more numbers.</p>
<p>We say a number <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>q</mi><mo>&#x02208;</mo><mi>&#x0211A;</mi></mrow></math> is <em>rational</em> if there exist two integers <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>p</mi><mo>&#x0002C;</mo><mi>r</mi><mo>&#x02208;</mo><mi>&#x02124;</mi></mrow></math> such that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>q</mi><mo>&#x0003D;</mo><mi>p</mi><mo>&#x0002F;</mo><mi>r</mi><mo>&#x0002E;</mo></mrow></math> That&rsquo;s it. The rational numbers are also numbers whose decimal representation is either finite or repeating. Where the integers gave us closure under addition, the rationals get us to closure under multiplication.</p>
<p>Notice again, that we&rsquo;re just talking in terms of multiplication and not division. It is tempting to think of division as multiplying by a reciprocal. It is true that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>a</mi><mo>&#x000B7;</mo><mstyle displaystyle="false" scriptlevel="0"><mfrac><mrow><mn>1</mn></mrow><mrow><mi>b</mi></mrow></mfrac></mstyle><mo>&#x0003D;</mo><mstyle displaystyle="false" scriptlevel="0"><mfrac><mrow><mn>1</mn></mrow><mrow><mi>b</mi></mrow></mfrac></mstyle><mo>&#x000B7;</mo><mi>a</mi></mrow></math>, for <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>a</mi><mo>&#x0002C;</mo><mi>b</mi><mo>&#x02208;</mo><mi>&#x0211A;</mi></mrow></math>, but it is not always true that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>a</mi><mo>&#x0002F;</mo><mi>b</mi><mo>&#x0003D;</mo><mi>b</mi><mo>&#x0002F;</mo><mi>a</mi><mo>&#x0002E;</mo></mrow></math> Division does not commute.</p>
<h3 id="division-by-zero">Division by zero</h3>
<p>Why can&rsquo;t you divide by zero? Well, you can, it&rsquo;s just nonsense. Don&rsquo;t think about it in terms of quantity. Think about it in terms of number. Consider the following <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mn>1</mn><mo>&#x000B7;</mo><mn>0</mn><mo>&#x0003D;</mo><mn>2</mn><mo>&#x000B7;</mo><mn>0</mn><mo>&#x0002E;</mo></mrow></math> Suppose I divide both left and right hand side by 0. I&rsquo;m left with <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mn>1</mn><mo>&#x0003D;</mo><mn>2</mn></mrow></math>, it&rsquo;s very obviously false. The problem with division by 0 isn&rsquo;t with division by 0. The problem is with multiplication by 0. If I start at 2 and decide I want to go to 5, I can get there many ways. I could add 3. I could multiply by <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mstyle displaystyle="false" scriptlevel="0"><mfrac><mrow><mn>5</mn></mrow><mrow><mn>2</mn></mrow></mfrac></mstyle></mrow></math>. If want to get back to 2 I could subtract 3 or divide by <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mstyle displaystyle="false" scriptlevel="0"><mfrac><mrow><mn>5</mn></mrow><mrow><mn>2</mn></mrow></mfrac></mstyle></mrow></math>. Algebraically, I&rsquo;m applying an operation followed immediately by its inverse.</p>
<p>Multiplying by 0 is not invertible, meaning that you can&rsquo;t get back to where you started. Invertible operations leave directions telling you how to get back home. A non-invertible operation let&rsquo;s you go someplace but it forces you to throw away the map you used to get their once you arrive.</p>
<h2 id="and-then-there-were-the-real-numbers">And then there were the Real numbers</h2>
<p>A full treatment of the construction of the real numbers is exhausting, so I&rsquo;m going to wave my hands a bit here.</p>
<p>The real numbers, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>&#x0211D;</mi></mrow></math>, are what you get when you ask &ldquo;Are there numbers that cannot be written as a ratio of two integers?&rdquo; The numbers that have this property are called <em>irrational numbers</em>. How do we know that such a number exists? I claim that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msqrt><mrow><mn>2</mn></mrow></msqrt></mrow></math> is irrational. The standard proof is by contradiction. </p>
<p>Assume that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msqrt><mrow><mn>2</mn></mrow></msqrt></mrow></math> is rational. Thus, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msqrt><mrow><mn>2</mn></mrow></msqrt><mo>&#x0003D;</mo><mstyle displaystyle="false" scriptlevel="0"><mfrac><mrow><mi>a</mi></mrow><mrow><mi>b</mi></mrow></mfrac></mstyle><mo>&#x0002C;</mo></mrow></math> for some <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>a</mi><mo>&#x0002C;</mo><mi>b</mi><mo>&#x02208;</mo><mi>&#x02124;</mi></mrow></math> where <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>a</mi><mo>&#x0002C;</mo><mi>b</mi></mrow></math> do not share any prime factors. This is to say <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mstyle displaystyle="false" scriptlevel="0"><mfrac><mrow><mi>a</mi></mrow><mrow><mi>b</mi></mrow></mfrac></mstyle></mrow></math> is in simplest form. Squaring both sides of the equation yields <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mn>2</mn><mo>&#x0003D;</mo><mstyle displaystyle="false" scriptlevel="0"><mfrac><mrow><msup><mi>a</mi><mn>2</mn></msup></mrow><mrow><msup><mi>b</mi><mn>2</mn></msup></mrow></mfrac></mstyle></mrow></math>. Applying a bit of algebra, we note that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mn>2</mn><msup><mi>b</mi><mn>2</mn></msup><mo>&#x0003D;</mo><msup><mi>a</mi><mn>2</mn></msup></mrow></math>. This implies that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msup><mi>a</mi><mn>2</mn></msup></mrow></math> is an even number. If <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msup><mi>a</mi><mn>2</mn></msup></mrow></math> is even, then <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>a</mi></mrow></math> must be even. So, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>a</mi><mo>&#x0003D;</mo><mn>2</mn><mi>c</mi></mrow></math>, for some <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>c</mi><mo>&#x02208;</mo><mi>&#x02124;</mi></mrow></math>. We know that <math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow><mn>2</mn><msup><mi>b</mi><mn>2</mn></msup><mo>&#x0003D;</mo><msup><mi>a</mi><mn>2</mn></msup><mo>&#x0003D;</mo><mo stretchy="false">&#x00028;</mo><mn>2</mn><mi>c</mi><msup><mo stretchy="false">&#x00029;</mo><mn>2</mn></msup><mo>&#x0003D;</mo><mn>4</mn><msup><mi>c</mi><mn>2</mn></msup><mo>&#x0002E;</mo></mrow></math> </p>
<p>Dividing through by 2 yields <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msup><mi>b</mi><mn>2</mn></msup><mo>&#x0003D;</mo><mn>2</mn><msup><mi>c</mi><mn>2</mn></msup></mrow></math>, so <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>b</mi></mrow></math> must also be even. Thus, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>b</mi><mo>&#x0003D;</mo><mn>2</mn><mi>d</mi></mrow></math> for some <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>d</mi><mo>&#x02208;</mo><mi>&#x02124;</mi></mrow></math>. This violates our assumption that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mstyle displaystyle="false" scriptlevel="0"><mfrac><mrow><mi>a</mi></mrow><mrow><mi>b</mi></mrow></mfrac></mstyle></mrow></math> was in simplest form. This is a contradiction. Therefore, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msqrt><mrow><mn>2</mn></mrow></msqrt></mrow></math> cannot be rational.</p>
<p>There you have it, there exists at least one irrational number.</p>
<h2 id="in-closing">In closing</h2>
<p>The ideas discussed in this post are simple and familiar to most, but just because something is simple and familiar doesn&rsquo;t mean we can&rsquo;t think deeply about them. Numbers don&rsquo;t just exist in a vacuum. They have structure. They have gaps. This whole post was an exercise in examining those gaps and seeing where they might lead.</p>
<p>We started with counting and natural numbers. We ended up with a subset chain <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>&#x02115;</mi><mo>&#x02282;</mo><mi>&#x02124;</mi><mo>&#x02282;</mo><mi>&#x0211A;</mi><mo>&#x02282;</mo><mi>&#x0211D;</mi></mrow></math> where each link was formed by asking some variation of &ldquo;What if &hellip;?&rdquo; An observant reader will notice that I have not mentioned the complex numbers. They will get their own post in the near future.</p>
<div class="footnote">
<hr />
<ol>
<li id="fn:1">
<p>IAoFF: I&rsquo;m fully aware of the set theoretic definition of natural numbers, equivalence classes, and Dedekind cuts. We&rsquo;re building intuitive scaffolding here, not trying to scare people away. I see you though, number theorists. I appreciate your work.&#160;<a class="footnote-backref" href="#fnref:1" title="Jump back to footnote 1 in the text">&#8617;</a></p>
</li>
<li id="fn:2">
<p>There are some folks who will say that 0 is not a natural number. Those folks are called assholes.&#160;<a class="footnote-backref" href="#fnref:2" title="Jump back to footnote 2 in the text">&#8617;</a></p>
</li>
<li id="fn:3">
<p>Interestingly, the existence of rational numbers was never really disputed. Euclid very clearly understood the concept of ratio.&#160;<a class="footnote-backref" href="#fnref:3" title="Jump back to footnote 3 in the text">&#8617;</a></p>
</li>
<li id="fn:4">
<p>We use <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>&#x02124;</mi></mrow></math> because of the German word <em>z&auml;hlen</em> which translates to &ldquo;count&rdquo; in English.&#160;<a class="footnote-backref" href="#fnref:4" title="Jump back to footnote 4 in the text">&#8617;</a></p>
</li>
</ol>
</div>]]></description>
    </item>
    <item>
      <title>What &#34;Converges&#34; Actually Means</title>
      <link>https://mathforthepeople.com/convergence-explained/</link>
      <guid isPermaLink="true">https://mathforthepeople.com/convergence-explained/</guid>
      <pubDate>Sat, 18 Apr 2026 00:00:00 +0000</pubDate>
      <author>Joe</author>
      <description><![CDATA[<p>The notion of convergence is absolutely fundamental in mathematics. </p>
<h2 id="the-picture">The picture</h2>
<p>Imagine a sequence of numbers — say,</p>
<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow><mn>0.9</mn><mo>&#x0002C;</mo><mtext>&#x000A0;</mtext><mn>0.99</mn><mo>&#x0002C;</mo><mtext>&#x000A0;</mtext><mn>0.999</mn><mo>&#x0002C;</mo><mtext>&#x000A0;</mtext><mn>0.9999</mn><mo>&#x0002C;</mo><mtext>&#x000A0;</mtext><mi>&#x02026;</mi></mrow></math></p>
<p>Each one is closer to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mn>1</mn></mrow></math> than the last. None of them is <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mn>1</mn></mrow></math>. But if I
ask &ldquo;is the sequence settling on something?&rdquo; you&rsquo;d say yes, obviously, it&rsquo;s
settling on <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mn>1</mn></mrow></math>. That intuition — the sequence is heading somewhere, even
if it never lands — is what convergence formalizes.</p>
<h2 id="the-promise">The promise</h2>
<p>Here&rsquo;s the precise version. A sequence <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msub><mi>a</mi><mn>1</mn></msub><mo>&#x0002C;</mo><msub><mi>a</mi><mn>2</mn></msub><mo>&#x0002C;</mo><msub><mi>a</mi><mn>3</mn></msub><mo>&#x0002C;</mo><mi>&#x02026;</mi><mo>&#x0002C;</mo><msub><mi>a</mi><mi>n</mi></msub></mrow></math> <em>converges
to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>L</mi></mrow></math></em> if, for any tolerance you can name — call it <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>&#x003B5;</mi></mrow></math>, no
matter how small — the sequence eventually gets within <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>&#x003B5;</mi></mrow></math> of
<math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>L</mi></mrow></math>, and stays there.</p>
<p>That last clause does the heavy lifting. &ldquo;Eventually&rdquo; means: there&rsquo;s some
position <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>N</mi></mrow></math> in the sequence past which everything is within <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>&#x003B5;</mi></mrow></math>
of <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>L</mi></mrow></math>. <em>Once you&rsquo;re close, you stay close.</em> Written precisely, it looks like this: </p>
<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow><mo stretchy="false">&#x0007C;</mo><msub><mi>a</mi><mi>n</mi></msub><mo>&#x02212;</mo><mi>L</mi><mo stretchy="false">&#x0007C;</mo><mo>&#x02264;</mo><mi>&#x003B5;</mi><mo>&#x0002C;</mo><mi>N</mi><mo>&#x02264;</mo><mi>n</mi><mo>&#x0002E;</mo></mrow></math></p>
<p>Convergence isn&rsquo;t about getting to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>L</mi></mrow></math>; it&rsquo;s about a binding promise that the wandering stops. We actually don&rsquo;t care if the sequence ever reaches <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>L</mi></mrow></math>. Convergence is a weaker version of equality.</p>
<p>It&rsquo;s worth noting that this is a <a href="/glossary/#partial-sum" class="glossary-ref" data-term="partial-sum">partial-sum-style</a>
argument when applied to series: a series <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mo>&#x02211;</mo><msub><mi>a</mi><mi>n</mi></msub></mrow></math> converges if its
partial sums form a sequence that converges in the sense above.</p>
<h2 id="a-concrete-example">A concrete example</h2>
<p>The walking-distance argument from <a href="/geometric-series/">Why the Geometric Series Adds Up</a> is the simplest
case. It is pretty straightforward to compute the first five partial sums</p>
<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow><mn>1</mn><mo>&#x0002C;</mo><mtext>&#x000A0;</mtext><mstyle displaystyle="false" scriptlevel="0"><mfrac><mrow><mn>3</mn></mrow><mrow><mn>2</mn></mrow></mfrac></mstyle><mo>&#x0002C;</mo><mtext>&#x000A0;</mtext><mstyle displaystyle="false" scriptlevel="0"><mfrac><mrow><mn>7</mn></mrow><mrow><mn>4</mn></mrow></mfrac></mstyle><mo>&#x0002C;</mo><mtext>&#x000A0;</mtext><mstyle displaystyle="false" scriptlevel="0"><mfrac><mrow><mn>15</mn></mrow><mrow><mn>8</mn></mrow></mfrac></mstyle><mo>&#x0002C;</mo><mtext>&#x000A0;</mtext><mstyle displaystyle="false" scriptlevel="0"><mfrac><mrow><mn>31</mn></mrow><mrow><mn>16</mn></mrow></mfrac></mstyle><mo>&#x0002E;</mo></mrow></math></p>
<p>By inspection, one can see a pattern starting to form, i.e. the <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msup><mi>n</mi><mrow><mi>t</mi><mi>h</mi></mrow></msup></mrow></math> partial sum is <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msub><mi>g</mi><mi>n</mi></msub><mo>&#x0003D;</mo><mstyle displaystyle="false" scriptlevel="0"><mfrac><mrow><msup><mn>2</mn><mrow><mi>n</mi><mo>&#x0002B;</mo><mn>1</mn></mrow></msup><mo>&#x02212;</mo><mn>1</mn></mrow><mrow><msup><mn>2</mn><mi>n</mi></msup></mrow></mfrac></mstyle></mrow></math>. The important thing to notice here is that the 1 in the numerator is a constant. As <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>n</mi></mrow></math> gets very large, that 1 is going to become arbitrarily small relative to <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msup><mn>2</mn><mrow><mi>n</mi><mo>&#x0002B;</mo><mn>1</mn></mrow></msup></mrow></math>. A bit of algebra yields </p>
<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow><msub><mi>g</mi><mi>n</mi></msub><mo>&#x0003D;</mo><mstyle displaystyle="false" scriptlevel="0"><mfrac><mrow><msup><mn>2</mn><mrow><mi>n</mi><mo>&#x0002B;</mo><mn>1</mn></mrow></msup><mo>&#x02212;</mo><mn>1</mn></mrow><mrow><msup><mn>2</mn><mi>n</mi></msup></mrow></mfrac></mstyle><mo>&#x0003D;</mo><mstyle displaystyle="false" scriptlevel="0"><mfrac><mrow><msup><mn>2</mn><mrow><mi>n</mi><mo>&#x0002B;</mo><mn>1</mn></mrow></msup></mrow><mrow><msup><mn>2</mn><mi>n</mi></msup></mrow></mfrac></mstyle><mo>&#x02212;</mo><mstyle displaystyle="false" scriptlevel="0"><mfrac><mrow><mn>1</mn></mrow><mrow><msup><mn>2</mn><mi>n</mi></msup></mrow></mfrac></mstyle><mo>&#x0003D;</mo><mn>2</mn><mo>&#x02212;</mo><mstyle displaystyle="false" scriptlevel="0"><mfrac><mrow><mn>1</mn></mrow><mrow><msup><mn>2</mn><mi>n</mi></msup></mrow></mfrac></mstyle><mo>&#x0002E;</mo></mrow></math> </p>
<p>As <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>n</mi></mrow></math> grows larger, we subtract increasingly smaller numbers from 2. That&rsquo;s convergence.</p>
<p>Compare with the series <math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow><msub><mi>D</mi><mi>n</mi></msub><mo>&#x0003D;</mo><munderover><mo>&#x02211;</mo><mrow><mi>k</mi><mo>&#x0003D;</mo><mn>0</mn></mrow><mi>n</mi></munderover><msup><mn>2</mn><mi>k</mi></msup><mo>&#x0003D;</mo><mn>1</mn><mo>&#x0002B;</mo><mn>2</mn><mo>&#x0002B;</mo><mn>4</mn><mi>&#x02026;</mi><mo>&#x0002B;</mo><msup><mn>2</mn><mi>n</mi></msup><mo>&#x0002E;</mo></mrow></math> Its partial sums grow without bound. There&rsquo;s no <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>L</mi></mrow></math> that the partial sums settle near, no
matter how generous a tolerance you allow. That series <em>diverges</em>. Why do we care about this distinction? Suppose <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msub><mi>D</mi><mi>n</mi></msub></mrow></math> did converge to some <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>D</mi></mrow></math>. </p>
<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow><mi>D</mi><mo>&#x0003D;</mo><mn>1</mn><mo>&#x0002B;</mo><munder><munder><mrow><mn>2</mn><mo>&#x0002B;</mo><mn>4</mn><mo>&#x0002B;</mo><mn>8</mn><mo>&#x0002B;</mo><mi>&#x02026;</mi></mrow><mo>&#x23DF;</mo></munder><mrow><mn>2</mn><mi>D</mi></mrow></munder></mrow></math></p>
<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow><mi>D</mi><mo>&#x0003D;</mo><mn>1</mn><mo>&#x0002B;</mo><mn>2</mn><mi>D</mi></mrow></math></p>
<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow><mi>D</mi><mo>&#x0003D;</mo><mo>&#x02212;</mo><mn>1</mn></mrow></math></p>
<p>This is very clearly nonsense. <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>D</mi></mrow></math> is the sum of positive numbers. This is why convergence matters.</p>
<h2 id="why-the-definition-is-shaped-this-way">Why the definition is shaped this way</h2>
<p>The definition for convergence may seem fiddly and dumb, but there&rsquo;s a reason for it. It&rsquo;s because it shows up all over the place. There are only so many good ideas in math and mathematicians figured out pretty early on that you should just reuse them wherever you can. When something is so ubiquitous the definition for it <em>must</em> be air tight.</p>]]></description>
    </item>
    <item>
      <title>Why the Geometric Series Adds Up</title>
      <link>https://mathforthepeople.com/geometric-series/</link>
      <guid isPermaLink="true">https://mathforthepeople.com/geometric-series/</guid>
      <pubDate>Wed, 15 Apr 2026 00:00:00 +0000</pubDate>
      <author>Joe</author>
      <description><![CDATA[<p>Suppose you take a step of length one, then half a step, then a quarter of a
step, and so on, halving each time. How far do you walk in total?</p>
<p>The honest answer is two, exactly two, and the surprise is not that it adds
up but that it adds up to something so clean. We&rsquo;re going to derive the
formula for an infinite <a href="/glossary/#geometric-series" class="glossary-ref" data-term="geometric-series">geometric series</a> carefully enough that, by the
end, the cleanness feels obvious.</p>
<h2 id="the-setup">The setup</h2>
<p>A <em>geometric series</em> is a sum where each term is a fixed multiple of the
previous one. If the first term is <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>a</mi></mrow></math> and the multiplier is <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>r</mi></mrow></math>, the
series looks like</p>
<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow><mi>S</mi><mo>&#x0003D;</mo><mi>a</mi><mo>&#x0002B;</mo><mi>a</mi><mi>r</mi><mo>&#x0002B;</mo><mi>a</mi><msup><mi>r</mi><mn>2</mn></msup><mo>&#x0002B;</mo><mi>a</mi><msup><mi>r</mi><mn>3</mn></msup><mo>&#x0002B;</mo><mo>&#x022EF;</mo></mrow></math></p>
<p>Now, how do we know that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>S</mi></mrow></math> is finite? Our walking example has <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>a</mi><mo>&#x0003D;</mo><mn>1</mn></mrow></math> and <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>r</mi><mo>&#x0003D;</mo><mn>1</mn><mo>&#x0002F;</mo><mn>2</mn></mrow></math>. The condition we&rsquo;ll need
is that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mo stretchy="false">&#x0007C;</mo><mi>r</mi><mo stretchy="false">&#x0007C;</mo><mo>&#x0003C;</mo><mn>1</mn></mrow></math> — that is, each term is strictly smaller than the last
in absolute value. Without that, the terms don&rsquo;t shrink, and a sum of
non-shrinking terms can&rsquo;t <a href="/glossary/#convergence" class="glossary-ref" data-term="convergence">converge</a> to anything. In fact, shrinking terms isn&rsquo;t enough to guarantee convergence.</p>
<h2 id="the-trick">The trick</h2>
<p>How does one compute an infinite sum in finite time? Well, you use a shortcut. Let <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>S</mi></mrow></math> stand for the sum. Then</p>
<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow><msub><mi>S</mi><mi>n</mi></msub><mo>&#x0003D;</mo><msubsup><mi>&#x003A3;</mi><mrow><mi>k</mi><mo>&#x0003D;</mo><mn>0</mn></mrow><mi>n</mi></msubsup><mi>a</mi><msup><mi>r</mi><mi>k</mi></msup></mrow></math></p>
<p>Now multiply both sides by <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>r</mi></mrow></math>:</p>
<p><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow><mi>r</mi><msub><mi>S</mi><mi>n</mi></msub><mo>&#x0003D;</mo><msubsup><mi>&#x003A3;</mi><mrow><mi>k</mi><mo>&#x0003D;</mo><mn>0</mn></mrow><mi>n</mi></msubsup><mi>a</mi><msup><mi>r</mi><mrow><mi>k</mi><mo>&#x0002B;</mo><mn>1</mn></mrow></msup></mrow></math></p>
<p>Subtract the second equation from the first. Almost everything cancels —
<math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow><msub><mi>S</mi><mi>n</mi></msub><mo>&#x02212;</mo><mi>r</mi><msub><mi>S</mi><mi>n</mi></msub><mo>&#x0003D;</mo><msubsup><mi>&#x003A3;</mi><mrow><mi>k</mi><mo>&#x0003D;</mo><mn>0</mn></mrow><mi>n</mi></msubsup><mi>a</mi><msup><mi>r</mi><mi>k</mi></msup><mo>&#x02212;</mo><msubsup><mi>&#x003A3;</mi><mrow><mi>k</mi><mo>&#x0003D;</mo><mn>0</mn></mrow><mi>n</mi></msubsup><mi>a</mi><msup><mi>r</mi><mrow><mi>k</mi><mo>&#x0002B;</mo><mn>1</mn></mrow></msup><mo>&#x0002C;</mo></mrow></math></p>
<p>by combining sums we have
<math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow><msubsup><mi>&#x003A3;</mi><mrow><mi>k</mi><mo>&#x0003D;</mo><mn>1</mn></mrow><mi>n</mi></msubsup><mrow><mo stretchy="true" fence="true" form="prefix">&#x00028;</mo><mi>a</mi><msup><mi>r</mi><mi>k</mi></msup><mo>&#x02212;</mo><mi>a</mi><msup><mi>r</mi><mrow><mi>k</mi><mo>&#x02212;</mo><mn>1</mn></mrow></msup><mo stretchy="true" fence="true" form="postfix">&#x00029;</mo></mrow><mo>&#x0003D;</mo><mi>a</mi><mo>&#x02212;</mo><mi>a</mi><msup><mi>r</mi><mrow><mi>n</mi><mo>&#x0002B;</mo><mn>1</mn></mrow></msup><mo>&#x0002E;</mo></mrow></math></p>
<p>Factor the left side and solve:</p>
<div id="eq:geometric" class="equation">
<math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow><msub><mi>S</mi><mi>n</mi></msub><mo>&#x0003D;</mo><mfrac><mrow><mi>a</mi><mo stretchy="false">&#x00028;</mo><mn>1</mn><mo>&#x02212;</mo><msup><mi>r</mi><mrow><mi>n</mi><mo>&#x0002B;</mo><mn>1</mn></mrow></msup><mo stretchy="false">&#x00029;</mo></mrow><mrow><mn>1</mn><mo>&#x02212;</mo><mi>r</mi></mrow></mfrac><mo>&#x0002C;</mo></mrow></math>
</div>

<p>since <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mo stretchy="false">&#x0007C;</mo><mi>r</mi><mo stretchy="false">&#x0007C;</mo><mo>&#x0003C;</mo><mn>1</mn><mo>&#x0002C;</mo></mrow></math> it follows that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><msup><mi>r</mi><mrow><mi>n</mi><mo>&#x0002B;</mo><mn>1</mn></mrow></msup><mo>&#x02192;</mo><mn>0</mn></mrow></math> as <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>n</mi><mo>&#x02192;</mo><mo>&#x0221E;</mo></mrow></math>. So <math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow><mi>S</mi><mo>&#x0003D;</mo><mfrac><mrow><mi>a</mi></mrow><mrow><mn>1</mn><mo>&#x02212;</mo><mi>r</mi></mrow></mfrac><mo>&#x0002E;</mo></mrow></math></p>
<p>That&rsquo;s the formula. For our walk, <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>a</mi><mo>&#x0003D;</mo><mn>1</mn></mrow></math> and <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>r</mi><mo>&#x0003D;</mo><mn>1</mn><mo>&#x0002F;</mo><mn>2</mn></mrow></math>, so <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>S</mi><mo>&#x0003D;</mo><mn>1</mn><mo>&#x0002F;</mo><mo stretchy="false">&#x00028;</mo><mn>1</mn><mo>&#x02212;</mo><mn>1</mn><mo>&#x0002F;</mo><mn>2</mn><mo stretchy="false">&#x00029;</mo><mo>&#x0003D;</mo><mn>2</mn></mrow></math>.
The total distance is exactly two steps, no matter how many halvings you
chain together.</p>
<p>Notice that we&rsquo;re dividing by <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mn>1</mn><mo>&#x02212;</mo><mi>r</mi></mrow></math>. Remember earlier, the condition that <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mo stretchy="false">&#x0007C;</mo><mi>r</mi><mo stretchy="false">&#x0007C;</mo><mo>&#x0003C;</mo><mn>1</mn></mrow></math>? Notice that as <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>r</mi><mo>&#x02192;</mo><mn>1</mn></mrow></math> the denominator approaches 0, which implies <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>S</mi><mo>&#x02192;</mo><mo>&#x0221E;</mo></mrow></math>.</p>
<h2 id="what-happens-when-mathblock27">What happens when <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mo stretchy="false">&#x0007C;</mo><mi>r</mi><mo stretchy="false">&#x0007C;</mo><mo>&#x0003E;</mo><mn>1</mn></mrow></math>?</h2>
<p>Suppose, we let <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>r</mi><mo>&#x0003D;</mo><mn>2</mn></mrow></math>. Then we get something like this:</p>
<div id="eq:geometric-diverge" class="equation">

<math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow><mi>S</mi><mo>&#x0003D;</mo><mfrac><mrow><mi>a</mi></mrow><mrow><mn>1</mn><mo>&#x02212;</mo><mn>2</mn></mrow></mfrac><mo>&#x0003D;</mo><mo>&#x02212;</mo><mi>a</mi><mo>&#x0003D;</mo><mi>a</mi><mo>&#x0002B;</mo><mn>2</mn><mi>a</mi><mo>&#x0002B;</mo><mn>4</mn><mi>a</mi><mo>&#x0002B;</mo><mn>8</mn><mi>a</mi><mo>&#x0002B;</mo><mo>&#x022EF;</mo></mrow></math>

</div>

<p>This is clearly nonsense for <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>a</mi><mo>&#x02260;</mo><mn>0</mn></mrow></math>. If <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>a</mi><mo>&#x0003E;</mo><mn>0</mn></mrow></math>, then <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mo>&#x02212;</mo><mi>a</mi><mo>&#x0003C;</mo><mn>0</mn></mrow></math>. The right hand side <math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow><mi>a</mi><mo>&#x0002B;</mo><mn>2</mn><mi>a</mi><mo>&#x0002B;</mo><mn>4</mn><mi>a</mi><mo>&#x0002B;</mo><mn>8</mn><mi>a</mi><mo>&#x0002B;</mo><mo>&#x022EF;</mo></mrow></math> is clearly the sum of positive numbers - it has no hope of being negative! The reason why it is nonsense is because the sum <em>diverges</em> for <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mo stretchy="false">&#x0007C;</mo><mi>r</mi><mo stretchy="false">&#x0007C;</mo><mo>&#x0003E;</mo><mn>1</mn><mo>&#x0002E;</mo></mrow></math> The summation formula we derived only makes sense when the sum <em>converges</em>.</p>
<h2 id="a-picture">A picture</h2>
<p>It helps to see the <a href="/glossary/#partial-sum" class="glossary-ref" data-term="partial-sum">partial sums</a> creeping up on their
<a href="/glossary/#limit" class="glossary-ref" data-term="limit">limit</a>:</p>
<figure>
<script type="text/tikz">
\begin{tikzpicture}[scale=1.0]
  % Axes: n on the horizontal, S_n on the vertical.
  \draw[->, thick] (-0.3,0) -- (6.7,0) node[right] {$n$};
  \draw[->, thick] (0,-0.2) -- (0,2.5) node[above] {$S_n$};

  % Integer ticks on the n-axis, 1 through 6.
  \foreach \n in {1,2,3,4,5,6}
    \draw (\n,0.06) -- (\n,-0.06) node[below] {$\n$};

  % Reference ticks on the S_n axis at 1 and at the limit, 2.
  \foreach \y/\lbl in {1/1, 2/2}
    \draw (0.06,\y) -- (-0.06,\y) node[left] {$\lbl$};

  % Horizontal limit line at S_n = 2.
  \draw[dashed] (0,2) -- (6.5,2) node[right] {limit};

  % Connect the partial sums to make the climb toward the limit visible.
  % S_n = 2 - (1/2)^{n-1}
  \draw[red, thin]
    (1,1) -- (2,1.5) -- (3,1.75) -- (4,1.875) -- (5,1.9375) -- (6,1.96875);

  % Partial sum dots.
  \foreach \n/\val in {1/1, 2/1.5, 3/1.75, 4/1.875, 5/1.9375, 6/1.96875}
    \fill[red] (\n,\val) circle (1.7pt);
\end{tikzpicture}
</script>
<figcaption>Partial sums of the geometric series with <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>a</mi><mo>&#x0003D;</mo><mn>1</mn></mrow></math> and <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>r</mi><mo>&#x0003D;</mo><mn>1</mn><mo>&#x0002F;</mo><mn>2</mn></mrow></math></figcaption>
</figure>

<p>Each red dot is a partial sum. They get closer and closer to two but never
reach it — and yet the limit, the place they&rsquo;re heading, is a real and
exact number.</p>
<h2 id="why-this-matters">Why this matters</h2>
<p>The geometric series shows up everywhere: in compound interest, in the
analysis of algorithms, in the geometry of fractals, in probability when
you ask &ldquo;how long until the first success?&rdquo; Whenever you see a sum where
each term is a fixed fraction of the last, you can apply the formula
above without rederiving it.</p>
<p>It&rsquo;s also the simplest example of an infinite process that converges to
a finite answer, and learning to trust that intuition — that something
endless can still be bounded — is one of the small mental pivots that
calculus is built on.</p>]]></description>
    </item>
    <item>
      <title>A Note on What This Blog Is</title>
      <link>https://mathforthepeople.com/welcome/</link>
      <guid isPermaLink="true">https://mathforthepeople.com/welcome/</guid>
      <pubDate>Wed, 01 Apr 2026 00:00:00 +0000</pubDate>
      <author>Joe</author>
      <description><![CDATA[<p>Hello there, The People. This is a blog about math, written for whoever wants to read it. I am
not particularly interested in writing for other mathematicians — there are
journals for that, and the journals are very good at their job. The journals 
also have a bunch of rules, and  while I understand them, I would prefer not 
to follow them. I am more interested in talking to non-mathematicians.</p>
<p>My goal is to present the ideas as simply as I can, but no simpler. I have no
intention to &ldquo;dumb things down.&rdquo; I think that is disrespectful. The posts will be cross-referenced. There is a glossary. You can hover over words like <a href="/glossary/#convergence" class="glossary-ref" data-term="convergence">converge</a> or <a href="/glossary/#limit" class="glossary-ref" data-term="limit">limit</a> to see their definition. At the end of each post you will find the rabbit hole, a list of other relevant blog posts that are referenced in the post you are reading. I have made it a point to make finding information as easy as possible.</p>
<p>There are no advertisements on this blog and there will never be any. There 
will be no tracking. I don&rsquo;t plan to sell merch. I don&rsquo;t have any social media accounts that I want to 
promote. This blog will never be slick or polished, but it won&rsquo;t be ugly. I refuse to render ugly equations.</p>
<p>Math is easy. Math is fun. Math is for the people.</p>]]></description>
    </item>
  </channel>
</rss>