mathematics posts - idmontie's Portfolio

In my previous post, ["On the Addition of Fractions, by Petri Mengoli"](/blog/post/2025-03-16-on-the-addition-of-fractions), I
wrote that the following inequality holds, with no proof:

$$
\frac{1}{1-n} + \frac{1}{n} + \frac{1}{n + 1} > \frac{3}{n}
$$

If we don't assume a specific value for the numerator of the right hand side of the
inequality, we can derive the inequality by starting with

$$
\frac{1}{1-n} + \frac{1}{n} + \frac{1}{n + 1} > \frac{a}{n}.
$$

Multiply through by $n$:

$$
\frac{n}{1-n} + \frac{b}{n + 1} + 1 > a.
$$

Set a common denominator for the left hand side:

$$
\frac{n(n+1) + n(n-1)}{(n-1)(n+1)} > a - 1
$$

Expanding the expression

$$
\frac{n^2 + n + n^2 - n}{n^2 - 1} > a - 1
$$

And simplifying

$$
\frac{2n^2}{n^2 - 1} > a - 1
$$

We notice that when $|n| > 1$, the left hand side of the expression is always positive.

If we let $n\to\infty$, then we see that

$$
\lim_{n\to\infty} \frac{2n^2}{n^2 - 1} \overset{\mathrm{H}}{=} \lim_{n\to\infty} \frac{4n}{2n} = 2
$$

through the use of L'Hospital's rule. We find that as $n\to\infty$, the value of n is always positive and a value greater than 2.

If we slightly re-arrange, we find the following:

$$
\frac{2n^2}{n^2 - 1} + 1 > a
$$

And now knowing that the left hand side approaches 3 from above as $n\to\infty$, we know
that $a$ can be set to $3$ as the largest value that still satisfies the expression.

Hence, we find that the original inequality posited holds.

Petri Mengoli Fraction Inequality

I was researching the origin of the Basel problem to write a short blog post about
how Euler approached the problem (only to get beaten by <a href="https://www.youtube.com/watch?v=jmtiWGnj5os">anime characters talking
about it</a>). I however wanted to
dive deeper into the context of why Euler wanted to even approach this problem,
so I investigated the work of Petri Mengoli.
The publication of his work &quot;On the Addition of Fractions&quot; is available via the
<a href="https://archive.org/details/bub_gb_PrKgVx1LcUUC/mode/1up">Internet Archive in its original Latin</a>.
Petri Mengoli&#x27;s work focuses on the harmonic series in the preface and shows
that it diverges. The harmonic series is written in modern notation as:
<math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><munderover><mo>∑</mo><mrow><mi>n</mi><mo>=</mo><mn>1</mn></mrow><mi mathvariant="normal">∞</mi></munderover><mfrac><mn>1</mn><mi>n</mi></mfrac><mo>=</mo><mn>1</mn><mo>+</mo><mfrac><mn>1</mn><mn>2</mn></mfrac><mo>+</mo><mfrac><mn>1</mn><mn>3</mn></mfrac><mo>+</mo><mfrac><mn>1</mn><mn>4</mn></mfrac><mo>+</mo><mo>…</mo></mrow><annotation encoding="application/x-tex">\sum_{n=1}^{\infty} \frac{1}{n} = 1 + \frac{1}{2} + \frac{1}{3} + \frac{1}{4} + \ldots</annotation></semantics></math>n=1∑∞​n1​=1+21​+31​+41​+…
His proof relies on finding groupings of fractions that sum greater to one
(which his paper refers to as &quot;unity&quot;). First, look at the first 3 terms after
&quot;unity&quot;: <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>1</mn><mi mathvariant="normal">/</mi><mn>2</mn><mo>+</mo><mn>1</mn><mi mathvariant="normal">/</mi><mn>3</mn><mo>+</mo><mn>1</mn><mi mathvariant="normal">/</mi><mn>4</mn></mrow><annotation encoding="application/x-tex">1/2 + 1/3 + 1/4</annotation></semantics></math>1/2+1/3+1/4. When added, we see that when we set common denominators:
<math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mn>6</mn><mi mathvariant="normal">/</mi><mn>12</mn><mo>+</mo><mn>4</mn><mi mathvariant="normal">/</mi><mn>12</mn><mo>+</mo><mn>3</mn><mi mathvariant="normal">/</mi><mn>12</mn><mo>=</mo><mn>13</mn><mi mathvariant="normal">/</mi><mn>12</mn><mo>&gt;</mo><mn>1</mn></mrow><annotation encoding="application/x-tex">6/12 + 4/12 + 3/12 = 13 / 12 &gt; 1</annotation></semantics></math>6/12+4/12+3/12=13/12&gt;1
And in fact, for any three terms:
<math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mfrac><mn>1</mn><mrow><mi>n</mi><mo>−</mo><mn>1</mn></mrow></mfrac><mo>+</mo><mfrac><mn>1</mn><mi>n</mi></mfrac><mo>+</mo><mfrac><mn>1</mn><mrow><mi>n</mi><mo>+</mo><mn>1</mn></mrow></mfrac><mo>&gt;</mo><mfrac><mn>3</mn><mi>n</mi></mfrac></mrow><annotation encoding="application/x-tex">\frac{1}{n - 1} + \frac{1}{n} + \frac{1}{n+1} &gt; \frac{3}{n}</annotation></semantics></math>n−11​+n1​+n+11​&gt;n3​
Next Mengoli shows that there is another group of fractions that adds up to
greater than one, and another set of fractions after that set that also adds up
to one. He demonstrates that for any given number, there is a finite set of
fractions that can be added to get a value greater than that. Therefore the
series must diverge.
His approach here is inspired by Archimedes&#x27; &quot;Quadrature of the Parabola&quot;,
and focuses on using the &quot;method of exhaustion&quot;, rather than manipulating
infinite series or dealing with limits.
From this work, comes the original quote of what became known as the Basel
problem:
<blockquote class="border-l-4 border-gray-300 pl-4">
Ab huius fractionum dispositionis contemplatione feliciter
expeditus, ad aliam progrediebar dispositionem, in qua
singulæ unitates numeris quadratis denominantur.
Hæc speculatio fructus quidem laboris rependit, nondum tamen
effecta est solvendo, sed ingenii ditioris postulat adminiculum,
ut præcisam dispositionis, quam mihimetipst proposui, summam
valeat reportare.
</blockquote>
Roughly translating to:
<blockquote class="border-l-4 border-gray-300 pl-4">
Having successfully concluded my contemplation of this arrangement
of fractions, I proceeded to another arrangement, in which
each unit is denominated by square numbers.
This speculation indeed rewards labor with fruit, but it has not
yet been completed in solving and demands the assistance of
greater ingenuity so that the precise sum of the arrangement
I proposed to myself may be recovered.
</blockquote>
This is the work that perhaps sparked the inspiration for Euler&#x27;s proof that the
sum of the reciprocal of the squares adds up to <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi>π</mi><mn>2</mn></msup><mi mathvariant="normal">/</mi><mn>6</mn></mrow><annotation encoding="application/x-tex">\pi^2 /6</annotation></semantics></math>π2/6 . Euler required much
more advanced mathematics and insight in order to come up with this equality, and
he revisited the sum in multiple letters with slightly different arguments to
validate his work.
For a full write up on this, see my self-published work here:
<a class="block flex-1 overflow-visible rounded-lg bg-white no-underline shadow-lg dark:bg-gray-800" href="/docs/on-the-addition-of-fractions.pdf"><div class="p-6"><h4 class="!m-0 !p-0 !text-base font-bold !no-underline">On the addition of fractions.pdf</h4></div></a>

I was researching the origin of the Basel problem to write a short blog post about
how Euler approached the problem (only to get beaten by [anime characters talking
about it](https://www.youtube.com/watch?v=jmtiWGnj5os)). I however wanted to
dive deeper into the context of why Euler wanted to even approach this problem,
so I investigated the work of Petri Mengoli.

The publication of his work "On the Addition of Fractions" is available via the
[Internet Archive in its original Latin](https://archive.org/details/bub_gb_PrKgVx1LcUUC/mode/1up).
Petri Mengoli's work focuses on the harmonic series in the preface and shows
that it diverges. The harmonic series is written in modern notation as:

$$
\sum_{n=1}^{\infty} \frac{1}{n} = 1 + \frac{1}{2} + \frac{1}{3} + \frac{1}{4} + \ldots
$$

His proof relies on finding groupings of fractions that sum greater to one
(which his paper refers to as "unity"). First, look at the first 3 terms after
"unity": $1/2 + 1/3 + 1/4$. When added, we see that when we set common denominators:

$$
6/12 + 4/12 + 3/12 = 13 / 12 > 1
$$

And in fact, for any three terms:

$$
\frac{1}{n - 1} + \frac{1}{n} + \frac{1}{n+1} > \frac{3}{n}
$$

Next Mengoli shows that there is another group of fractions that adds up to
greater than one, and another set of fractions after that set that also adds up
to one. He demonstrates that for any given number, there is a finite set of
fractions that can be added to get a value greater than that. Therefore the
series must diverge.

His approach here is inspired by Archimedes' "Quadrature of the Parabola",
and focuses on using the "method of exhaustion", rather than manipulating
infinite series or dealing with limits.

From this work, comes the original quote of what became known as the Basel
problem:

> Ab huius fractionum dispositionis contemplatione feliciter
expeditus, ad aliam progrediebar dispositionem, in qua
singulæ unitates numeris quadratis denominantur.
Hæc speculatio fructus quidem laboris rependit, nondum tamen
effecta est solvendo, sed ingenii ditioris postulat adminiculum,
ut præcisam dispositionis, quam mihimetipst proposui, summam
valeat reportare.
>

Roughly translating to:

> Having successfully concluded my contemplation of this arrangement
of fractions, I proceeded to another arrangement, in which
each unit is denominated by square numbers.
This speculation indeed rewards labor with fruit, but it has not
yet been completed in solving and demands the assistance of
greater ingenuity so that the precise sum of the arrangement
I proposed to myself may be recovered.
>

This is the work that perhaps sparked the inspiration for Euler's proof that the
sum of the reciprocal of the squares adds up to $\pi^2 /6$ . Euler required much
more advanced mathematics and insight in order to come up with this equality, and
he revisited the sum in multiple letters with slightly different arguments to
validate his work.

For a full write up on this, see my self-published work here:

<DownloadCard
 href="/docs/on-the-addition-of-fractions.pdf"
 title="On the addition of fractions.pdf"
/>