You're reading: The Big Internet Math-Off 2024

The Big Internet Math-Off 2024, the final!

Here’s the final match of The Big Internet Math-Off.

Over the past month, we’ve heard from 16 interesting mathematicians and whittled them down to just 2. Today, we’re pitting Matt Enlow against Angela Tabiri to determine The World’s Most Interesting Mathematician (2024, of the people who I asked to take part and were available).

Take a look at both pitches, vote for the bit of maths that made you do the loudest “Aha!”, and if you know any more cool facts about either of the topics presented here, please write a comment below!

Matt Enlow – Hidden in Pascale’s Triangle

Dedication

John Barrow

I would like to dedicate today’s excursion to my 11th- and 12th-grade math teacher, John Barrow, who passed away on June 20th of this year. It’s safe to say that I wouldn’t be here, doing this, if it weren’t for him. He encouraged me to double up in math my junior year, and then in my senior year, he taught me AP Calculus BC one-on-one. I don’t think I appreciated at the time what a privilege that was—particularly to be doing it with such a kind-hearted, caring, and inspirational teacher. Rest in peace, Mr. Barrow.

Excursion

Today we will be looking at a mathematical “object” that has been a favorite of mathematicians for millenia: Pascal’s Triangle.

Pascal's Triangle: rows of numbers, starting 1; 1, 1; 1, 2, 1; ...

A lot of people already know that the sums of the entries in the rows of Pascal’s Triangle are the powers of two:

Sums of the rows of Pascal's Triangle: 1, 2, 4, 8, 16, 32, ...

But what you may not know is that if, instead, you multiply the entries in each row together, you get…

Products of rows of Pascal's triangle: 1, 1, 2, 9, 96, 2500, 162000, 26471025, 11014635520 11759522374656, 32406091200000000

… uh… numbers that get really big, really fast!

Okay, so maybe that’s not so much of a surprise. Particularly since the entries in the triangle increase in size rather quickly themselves.

But suppose we wanted to try to get a better handle on just how quickly those products are increasing. One way we could do that is by calculating the ratios of successive products. In other words: How many times greater is each row’s product than the previous row’s product? If, for example, those ratios were to approach some constant, we could say that the products were increasing approximately exponentially.

First, let’s get a little more data. (By convention, we call the “row” with a single 1 in it the \(0^{\text{th}}\) row, and the next row, with two 1’s in it, the \(1^{\text{st}}\) row, etc.)

Table of n and product of entries in row n. The products read: 1 , 1 ,
2 ,
9 ,
96 ,
2500 ,
162000 ,
26471025 ,
11014635520 ,
11759522374656 ,
32406091200000000 ,
231627686043080250000 ,
4311500661703860387840000 ,
209706417310526095716965894400 ,
26729809777664965932590782608648192 ,
8950867799438312225700843177441650390625 ,
7891603768794982103022698264675745792000000000 ,
18353902479339777398539286170223043103166562304000000 ,
112795686399906032999092018854826202629376512682184671232000 ,
1834493968908496701191486235212580573759418350510030724843416059904 ,
79066330722619596372996565652923155223974495355703509647360000000000000000

Whoa. Those are indeed some big numbers. In the interest of conserving space, I’ll write them using scientific notation.

But before I do that… I’m noticing something. Look at the curve formed by the lead digits of the products. I can tell just by looking at that curve that these numbers are increasing more quickly than merely exponentially. If the numbers were increasing exponentially, then that curve would not be curved at all; it would look more like a straight line. For example, check out the list of the first 50 powers of 162 below.

Powers of 162, one on each row. Each row has two more digits than the last. The rows begin: 162, 26244, 4251528, ...

Technically, that is what exponential growth looks like: a nice, straight line!

Okay. So. Anyway. Scientific notation.

Okay. Now let’s calculate the ratios of successive products, as mentioned earlier:

Table of n, product of entries in row n, and ratios of each row to the previous. The ratios read: 1.0,
2.0,
4.5,
10.7,
26.0,
64.8,
163.4,
416.1,
1067.6,
2755.7,
7147.7,
18613.9,
48638.8,
127463.0,
334864.6,
881658.0,
2325750.6,
6145596.9,
16263866.4,
43099804.1

As expected, these ratios themselves are increasing rather quickly. Ah, but… Notice the steep slope of the lead digits. That looks much straighter than the curve in the earlier list of products! So maybe… the sequence of ratios is growing exponentially? Let’s look at the ratios… of the ratios! (We’ll call these the “second ratios.”)

Table of n, product of entries in row n, ratios, and second ratios. The second ratios read: 2.00000, 2.25000, 2.37037, 2.44141, 2.48832, 2.52163, 2.54650, 2.56578, 2.58117, 2.59374, 2.60420, 2.61304, 2.62060, 2.62715, 2.63288, 2.63793, 2.64241, 2.64643, 2.65003

Aha! (… Again, this is where you yell “Aha!” really loudly.) These second ratios are much better behaved. They are increasing, but it looks like the rate at which they are increasing… is decreasing. So a natural thing to wonder at this point is, are these second ratios approaching a specific value, or will they increase without bound?

(… I think I just felt a few shivers of ecstasy from some of you out there who see where this might be going…)

Limits

Let’s introduce some notation to help us try to get an answer to this question. Define \(p(n)\) as the product of the entries in the \(n\)th row of Pascal’s Triangle. In other words, \[p(n):=\prod_{k=0}^{n}\binom{n}{k}=\prod_{k=0}^{n}\frac{n!}{(n-k)!k!}.\]

Now. How can we create an expression for those second ratios using \(p(n)\)? Well, the sequence of first ratios begins \[\frac{p(1)}{p(0)}, \frac{p(2)}{p(1)}, \frac{p(3)}{p(2)}, \frac{p(4)}{p(3)},\ldots,\frac{p(n+1)}{p(n)},\ldots\] which means that the sequence of second ratios begins \[\frac{p(0)p(2)}{p(1)^2}, \frac{p(1)p(3)}{p(2)^2}, \frac{p(2)p(4)}{p(3)^2},\ldots,\frac{p(n-1)p(n+1)}{p(n)^2},\ldots\]

So it looks like what we’re hoping to determine is the value (if it exists) of \[\lim_{n\to\infty}\frac{p(n-1)\,p(n+1)}{p(n)^2}.\]

The prospect of using our definition of \(p(n)\) to evaluate this limit seems daunting; the notation-wrangling alone is enough to make us want to leave it to someone else.

Fortunately, this \(p\) function of ours has a nifty property (proven in the Postscript): For all values of \(n\), \[\frac{p(n+1)}{p(n)}=\frac{(n+1)^n}{n!}.\]

You may recognize the expression on the left as representing our first ratios. So if you plug values of 0, 1, 2, 3, etc. in for \(n\) in the right-hand expression, you will see that you get the values of those first ratios calculated earlier: \[\frac{1^0}{0!}=1,\qquad \frac{2^1}{1!}=2,\qquad \frac{3^2}{2!}=4.5,\qquad \frac{4^3}{3!} \approx 10.7,\qquad \text{etc.}\]

Now let’s take another look at that expression for which we’re trying to find a limit, and make use of that nifty property: \[\frac{p(n-1)p(n+1)}{p(n)^2} = \frac{\ \frac{p(n+1)}{p(n)}\ }{\ \frac{p(n)}{p(n-1)}\ } = \frac{\frac{(n+1)^n}{n!}}{\frac{n^{n-1}}{(n-1)!}}\] And this expression actually simplifies quite nicely: \[\frac{\frac{(n+1)^n}{n!}}{\frac{n^{n-1}}{(n-1)!}} = \frac{(n-1)!\,(n+1)^n}{n!\;n^{n-1}} \\ = \frac{n+1}{n}\left(\frac{n+1}{n}\right)^{n-1} = \left(1+\frac{1}{n}\right)^n.\] And, as most calculus students know, \[\lim_{n\to\infty}\left(1+\frac{1}{n}\right)^n \approx 2.71828,\] better known as Euler’s number, or simply \(e\).

I was scandalized when I first encountered this. What on earth is \(e\) doing in Pascal’s Triangle?!? Even though we just proved it, it’s still hard to make sense of.

Showing that something is true does not necessarily illuminate why it’s true. I think I’ve done the former here, but I think it would take some more contemplation on my part before I’m able to do the latter.

I would love to hear your attempts at such illumination!

Oh, and by the way: Those of you who read the title of my pitch and thought, “Wait a minute—there’s no ‘e’ in ‘Pascal’!”… Well, now you know the truth!

Postscript: Proof that \(\frac{p(n+1)}{p(n)}=\frac{(n+1)^n}{n!}\)

\[\begin{aligned} \frac{p(n+1)}{p(n)} &= \frac{\prod_{k=0}^{n+1}\frac{(n+1)!}{(n+1-k)!k!}}{\prod_{k=0}^{n}\frac{n!}{(n-k)!k!}} & & \text{by definition}\\[0.5em] &= \frac{\prod_{k=0}^{n}\frac{(n+1)!}{(n+1-k)!k!}}{\prod_{k=0}^{n}\frac{n!}{(n-k)!k!}} & & \text{remove a “1” from the top product} \\[0.5em] &= \prod_{k=0}^{n}\frac{\ \frac{(n+1)!}{(n+1-k)!k!}\ }{\ \frac{n!}{(n-k)!k!}\ } & & \text{combine products} \\[0.5em] &= \prod_{k=0}^{n}\frac{(n+1)!(n-k)!k!}{(n+1-k)!k!n!} & & \text{invert and multiply} \\[0.5em] &= \prod_{k=0}^{n}\frac{n+1}{n+1-k} & & \text{simplify} \\[0.5em] &= \frac{\prod_{k=0}^{n}(n+1)}{\prod_{k=0}^{n}(n+1-k)} & & \text{separate products} \\[0.5em] &= \frac{(n+1)^{n+1}}{(n+1)!} & & \text{simplify} \\[0.5em] &= \frac{(n+1)^n}{n!} & & \text{cancel an }n+1 \end{aligned}\]

Matt EnlowMatt Enlow teaches mathematics at the Dana Hall School in Wellesley, MA. You can follow him on X, BlueSky and Mathstodon.

Angela Tabiri – #MathsMotivation

We start off today’s pitch with a hands-on activity. For this, you need three circular objects, a thread, a rule, a paper and a pen. Using the thread, find the length of the circular object by wrapping the thread around the object and measuring it on the rule. Record this in one column on the paper. Next, locate the centre of the circular object and measure the diameter (from one end of the circle through the centre to the opposite end). Record this diameter in another column on the paper. In a third column, divide the length of the circular object by the diameter. Repeat this process for the two remaining circular objects. What do you observe? Irrespective of the size of the circular object, the ratio of the length (circumference) to the diameter is a constant, called Pi (π).

In a quest to find the area of a circle, we unwrap the circle to get a right angled triangle with base \(2\pi r\) and height \(r\). Then the area of this right angled triangle is \(\frac{1}{2} \times 2 \pi r \times r \) which is equal to \(\pi r ^2\). Hence, the area of the circle is \(\pi r^2\).

Let us continue to the world of prime numbers to learn some interesting facts. The first few prime numbers are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, … They seem to be random with no pattern. However, if we take any prime number greater than or equal to 5 and square it, the result is divisible by 24 with a remainder of 1. For instance \(5^2 = 24 + 1\), \(7^2 = 2 \times 24 + 1\), \(11^2 = 5 \times 24 + 1\), …

Recall that the first few digits of the number \(\pi\) are 

\[ \pi = 3.14159 26535 89793 23846 26433 83279 50288 41971 69399 37510 58209 74944 59230 78164 06286 20899 8628 03482 53421 17067 \ldots \]

Recall the prime chunks from Katie’s pitch. Then, the first prime chunk after 3 is 14159. Squaring this results in \( 14159^2 = 8,353,220 \times 24 + 1\). As an assignment, you can verify this for the other prime chunks in \(\pi\).

For our third interesting fact, we consider the sequence 1, 1, 2, 3, 5, 8, … called the Fibonacci sequence. If we draw golden rectangles as pitched by Matt, we can find the ratio of the sides of the rectangles. This ratio gives the golden ratio \(\Phi\). The golden ratio is common in nature, in particular on the body. The proportion of the length of the body from the head to toe, to the length from the head to the navel exhibits the golden ratio. This is evident in Leonardo Da Vinci’s The Vitruvian Man. Also, the ratio of the length from the top of the nose of an adult to the centre of the lip to the length from the centre of the lip to the chin exhibits the golden ratio. Cosmetic surgeons use the golden ratio in reconstructing the face.

Why should we care about all these interesting facts? They make maths fun and rewarding as diverse careers can be pursued after a strong foundation in mathematics. Example: Data scientist, software engineering, sound engineer, accounting, … Thus, your love for mathematics can be translated into a rewarding career.

If you found this pitch interesting and would like me to be crowned the World’s Most Interesting Mathematician, vote for me 😇 and subscribe to the Femafricmaths YouTube channel.

Medaase! Asante Sana! A dupe! Na gode! Merci! Mweebale! Murakoze Urakoze! Thank you!

Angela TabiriAngela Tabiri is a mathematician and youth mentoring in STEM expert from Ghana. She is the founder of Femafricmaths, a non profit organisation that promotes female African mathematicians to highlight the diversity in careers after a degree in mathematics. You can follow Femafricmaths on YouTube, Instagram, Facebook and X.


So, which bit of maths has tickled your fancy the most? Vote now!

Final: Matt Enlow vs Angela Tabiri

#MathsMotivation
(64%, 805 Votes) 805 Votes
Hidden e!
(36%, 456 Votes) 456 Votes

Total Voters: 1,261

This poll is closed.

Loading ... Loading ...

Voting is now closed: Angela Tabiri is the World’s Most Interesting Mathematician (2024, of the people who I asked to take part and were available)!

Congratulations Angela, and thanks to Matt and everyone else for playing this year!

102 Responses to “The Big Internet Math-Off 2024, the final!”

  1. Avatar Christina Agana

    Dr. Tabiri makes maths learning simple and fun. Watching her videos, I can relate maths to every day practical life. Keep it up!

    Reply
  2. Avatar Anonymous

    Have learnt something interesting in mathematics today. I am voting for Dr. Angela.

    Reply
  3. Avatar Gabriel Aboyadana

    Congratulations to both of you for coming this far. You are both geniuses.
    I personally like the practical nature of Angela’s entry. It is more relatable. I wish her good luck!

    Reply
  4. Avatar Gertrude Michelle

    Thank you, Dr. Angela, that was so insightful. I am for Dr.Angela.

    Reply
  5. Avatar Annie Okyere

    You make mathematics so interesting Dr Angela. Go make Ghana and your community proud.

    Reply
  6. Avatar Bryan

    I voted for Matt Enlow.

    Before I started my two assumptions were Angela Tabiri will knock my socks off and Matt Enlow couldn’t even spell check.

    My biggest ‘aha’ today came as soon as I saw 2.6…

    I enjoyed both greatly.

    And Dr. Tabiri did indeed knock my socks. That was a wonderful demonstration.

    Reply
    • Avatar Kwame AMPONFI JNR

      I am voting for Angela for her simplification of Mathematics. She also radiat a sense of humility in her academic engagements.

      Reply
  7. Avatar Anonymous

    I am voting for Matt. His presentation reinforces the math learning process: collect some numerical data, analyze them, make some conjectures and prove them! Well done.

    I am not voting for Angela, mainly because she perpetuates the bogus myth about the golden ratio, the body and art. There are many serious discussions about this, for example:

    https://eusci.org.uk/2020/07/29/myth-busting-the-golden-ratio/

    Reply
  8. Avatar Irene

    #MathsMotivation is indeed an insightful motivation… Can’t wait for Angela to be crowned as the maths queen

    Reply
  9. Avatar Jones Osei

    With Maths motivation everyone can learn maths! Great thanks Dr. Angela!

    Reply
  10. Avatar Lolonyo Kwami Agbeyaka I

    Fully behind you, Angela. You’re an inspiration to girls all around the globe.

    Reply
  11. Avatar Anonymous

    I voted for the great Maths Giant Dr. Angela Tabiri….a friend and sister. Fly higher.

    Reply
  12. Avatar Thomas Robert Annan

    I voted for the Great Maths Giant Dr. Angela Tabiri…a friend and sister. Fly higher.

    Reply
  13. Avatar Vera Hayibor

    I am fascinated by Angela Tabiri’s presentation. My vote goes to Her!

    Reply
  14. Avatar Esmeralda Thompson

    Fascinating, I couldn’t vote cos I was late. I’d however love to see Matt’s. I saw Angela’s presentation.

    Reply
  15. Avatar Joseph Digba

    Wow! Amazing excellent Sharp brained Lady Angela
    I’m gonna push this as far as I can.

    Reply

(will not be published)

$\LaTeX$: You can use LaTeX in your comments. e.g. $ e^{\pi i} $ for inline maths; \[ e^{\pi i} \] for display-mode (on its own line) maths.

XHTML: You can use these tags: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <s> <strike> <strong>