We all must have heard about a popular story involving the great Mathematician Carl Friedrich Gauss and his teacher during his school days. The story goes as: Gauss had a lazy teacher. The so-called educator wanted to keep the kids busy so he could take a nap; he asked the class to add the numbers 1 to 100. To the teacher's surprise, Gauss approached the teacher with his answer of 5050 so quick that the teacher thought Gauss cheated. Well you know sometimes, when you are so ahead of your time or things are too good, people don't believe in you.
Anyway moving on, the formula which Gauss had found to get the answer was,
This is one of the results which is widely known.
Let's look at how this result can be formed intuitively using three methods.
Method 1: Pairing Numbers
This method is the most common method to approach this problem.
For example, If we were asked what is the sum of
Instead of simply adding them up we can pair them up as,
1 2 3 4 5 |
10 9 8 7 6 |
And then we can observe an interesting pattern, i.e. the sum of each column is 11.
As there are 5 columns so, the required sum=5×11=55
Also we can see that, the sum of each column is (10+1)
Thus we can generalize the required sum as
Method 2: Making Rectangles
Again the question remains the same, what is the sum of
Now this time we represent the numbers by a black box. So, instead of
Now let's mirror our triangle,
Here we can see that there are 10×11
i.e.
Now we can generalize how we did in method 1, total black box or sum of black box
Method 3: A proof by Loren Larson, professor emeritus at St. Olaf College.
Credit: https://mathoverflow.net/q/8847
Our aim is to find the sum of the yellow discs in the above figure.
In the above figure,
There are 7 rows, the first 6 rows are of yellow discs and the
We can see from the animation that every yellow disc correspond to a unique pair of blue discs or a pair of unique blue discs from the
We can then simply calculate the total unique pairs of blue discs as
In more general term,
Total unique pairs of blue discs =
Here, n is the number of yellow discs in the second last row.
n+1 is the number of blue discs in the last row.
As there is a bijection between unique pairs of blue discs and unique yellow disc thus there are
There are many other methods of arriving to the formula above but for now we discuss these three only.
Now let's move on from the sum of 1 to n.
Before directly going on to the statement let me give some relations,
Did you notice some pattern here?
Try it before you look below.
Well here is the pattern,
In general,
Or,
This can be proved via induction. For now, we won't get into the proof.
But instead, we will have a look at the following image (from Ned Gulley) and look at the graphical method of understanding the result.
Now that was interesting. Let's look at some other results quickly.
Again let me start with a few examples,
Here we can see a pattern that, for a number
For 153,
These numbers are called Armstrong numbers.
All one-digit numbers are Armstrong numbers.
Moving onto the next result,
Let's again start with a few examples,
Here we can see a pattern that some natural numbers that can be represented as the sum of four integer squares. Well, it turns out not only some but every natural number can be represented as the sum of four integer squares and this is the famous Lagrange's four-square theorem.
From Gauss to Lagrange, we got to know about many famous results. What's common in all of them was that they all loved looking at patterns and then trying to prove that the pattern works for the general case. Maybe one day you can develop a pattern and be the next Gauss or Lagrange.
That's all for this time and hope you all got to know about some famous results in Mathematics.
-Aakash Gurung
Interesting
ReplyDeleteexciting results dai
ReplyDelete