Ini adalah salah satu masalah matematika tertua yang belum terpecahkan. Masalah ini bisa ditelusuri hingga 2000 tahun yang lalu. Beberapa matematikawan paling cerdas sepanjang sejarah telah mencoba memecahkannya, tetapi semuanya gagal. Bahkan, jika kamu bisa menemukan angka baru yang memenuhi syarat, kamu bisa mendapatkan hadiah sebesar 250 ribu dolar atau sekitar Rp.4 miliar kurs sekarang. Seperti yang disebutkan dalam judul video kami, kita tulis dulu tiga angka berikut ini : 6, 28, 496. Perhatikan pola di antara angka-angka ini, bisakah kamu menulis apa angka selanjutnya? Kamu bisa menjeda video ini dan mencoba menuliskan angka selanjutnya. Jika kamu berhasil menemukan polanya, kamu akan menyadari bahwa angka-angka ini sangat istimewa, sangat sempurna.
This is one of the oldest mathematical problems that has not yet been solved.
This problem can be traced back to 2,000 years ago.
Some of the smartest mathematicians in history have tried to solve it,
but all failed.
In fact, if you can find a new number that meets the conditions,
you can get a prize of $ 250,000 or about 4 billion rupiahs currently.
As mentioned in the title of our video,
let's write the following three numbers first.
6
28
496
Pay attention to the pattern between these numbers.
Can you write the next number?
You can pause this video and try to write the next number.
If you manage to find the pattern,
you will realize that these numbers are very special, very perfect.
Greetings and best wishes to the viewers of Setia Mata Ketiga.
In this episode, we will discuss the perfect numbers that have been known since ancient times.
In 2000, Italian mathematician Pier Giogrio Odefredi
introduced the solution of the perfect number problem as one of the four most pressing mathematical problems to be solved at that time.
The problem is,
is there a perfect number in the form of a odd number?
To solve this problem,
we have to find a special number that matches a certain pattern.
Therefore,
Mathematicians use computers to check the numbers below 10 to the power of 2200.
But until now, the results are disappointing.
So what is a perfect number?
A unique perfect number pattern.
What is a perfect number pattern?
Let's take the number 6 as an example to find its pattern.
We can divide it by 1, 2, 3, and 6.
We ignore the number 6 first,
because this is the number itself,
so we only have 1, 2, and 3 as a factor.
If we sum it all up,
the result is 6,
which is the number itself.
This number is called a perfect number.
You can also try with another number.
For example, for the number 10.
In addition to the number 10 itself,
the factors are 1, 2, and 5.
If we sum it up,
we will get 8, not 10.
So 10 is not a perfect number.
Now,
we can repeat this process for all other numbers.
Below the number 100,
you will find that the perfect number after 6 is 28.
If we expand the search to the number 10,
we will find the next two perfect numbers,
which are 496 and 8128.
The numbers 6, 28, 496, and 8128
are all perfect numbers known to ancient Greeks
and are all perfect numbers found for more than 1,000 years.
Maybe you will say,
if we can find the pattern and rules that make up these numbers,
we can use it to predict other perfect numbers.
Let's try together.
What is the similarity of these numbers?
One thing that seems clear,
every perfect number is always much larger than the previous number.
The other similarity is that their last number
alternates between 6 and 8,
which means all of them are perfect numbers.
But the special feature does not stop there.
There is still something more unique.
We can write 6 as a number of 1, 2, and 3.
6 is equal to 1 plus 2 plus 3.
Write 28 as a number of 1, 2, 3, 4, 5, 6, and 7.
28 is equal to 1 plus 2 plus 3 plus 4 plus 5 plus 6 plus 7.
For the other numbers, it is also the same.
All are a number of consecutive numbers.
Other than that, except for the number 6,
each number is a number of columns of odd numbers in a row.
So, 28 is the number of columns 1 and 3.
496 is the number of columns 1, 3, 5, and 7.
Meanwhile, 8128 is the number of columns 1, 3, 5, 7, and 15.
But there is something more surprising.
If you write these numbers in binary form,
6 becomes 110, 28 becomes 11,100,
496 becomes 111,110,000,
and the number 8128 can be guessed.
But this is not over.
These numbers are a number of columns 2.
Around 310 BC, Euclid found this perfect number pattern and thought in a similar direction.
Euclid's Algorithm
Euclid observed these numbers and wrote a formula to find the perfect number.
Let's see the process of Euclid finding this formula.
We start by multiplying 1 by 2, from 2 to 4, then to 8, 16, 32, 64, and so on.
Now start from the number 1, add the next number to it, so 1 plus 2 becomes 3.
If the result of this multiplication is a prime number, then multiply it by the last number of the column to get the perfect number.
For example, 2 times 3 is equal to 6, which is the first perfect number.
Now we continue this process.
Add 1, 2, and 4.
1 plus 2 plus 4, the result is 7, which is also a prime number.
Therefore, multiply it by the last number, which is 4, the result is 28.
This is the next perfect number.
Next, add 1, 2, 4, and 8.
1 plus 2 plus 4 plus 8, the result is 15.
But 15 is not a prime number, so we continue to add 16.
1 plus 2 plus 4 plus 8 plus 16, the result is 31, which is a prime number.
Therefore, multiply it by the previous number, which is 16, and the result is 496.
This is the third perfect number.
If you continue this process, you will find a larger perfect number.
We simplify the above process and write it in the form of a sum to find the perfect numbers.
For example, 6 is equal to 1, plus 2, multiplied by 2, the result is 1.
Next, 28 is equal to 1, plus 2, plus 4, multiplied by 2, the result is 2.
496 is equal to 1, plus 2, plus 4, plus 8, plus 16, multiplied by 2, the result is 4.
Where the number of the first type is a prime number.
However, there is a simpler way to write this sum.
Because 2 to the power of 0 is equal to 1, then 6 is equal to 2 to the power of 0, plus 2 to the power of 1, multiplied by 2 to the power of 1.
If we continue this calculation, we can get a general formula related to the second type.
So, 6 is equal to 2 to the power of 2, minus 1, multiplied by 2, the result is 1.
28 is equal to 2 to the power of 3, minus 1, multiplied by 2, the result is 2.
496 is equal to 2 to the power of 5, minus 1, multiplied by 2, the result is 4.
Do you see the ball?
This number is always greater than the previous one.
So, if we call it P, then we can get the Euclid formula to find the perfect number.
The perfect number is equal to 2 to the power of P, minus 1, multiplied by 2 to the power of P, minus 1.
Of course, P must meet certain conditions, namely 2 to the power of P, minus 1, must produce a prime number.
From this formula, we can see that 2 to the power of P, minus 1, is an even number,
so the perfect number obtained from this formula is also an even number.
Thus, Euclid found a way to produce an even perfect number,
but he did not prove that this was the only way.
Then, is there any other way to get a perfect number?
Or even, is there a perfect number in the form of an odd number?
Theorem of Nicomachus
400 years later, in the year 60 AD,
the Greek philosopher Nicomachus published a book entitled
Introduction to Arithmetic, which became the standard in Arithmetica for the next 1,000 years.
In his book, he stated five hypotheses that he considered true,
but he did not try to prove whether the hypothesis was true or not.
His hypothesis is that the perfect number to N has N digits.
All perfect numbers are even numbers,
and all perfect numbers end with 6 and 8 alternately.
Euclid's algorithm can produce all perfect even numbers,
and there are even numbers that are not counted.
For the next 1,000 years, no one was able to prove or deny this hypothesis,
and they were accepted as a fact.
However, in the 13th century,
the mathematician Egyptian Ibn Phallus
published a list containing ten perfect numbers and their P values.
Although three of them were later proven to be not perfect numbers,
the other seven were perfect numbers.
Of these seven perfect numbers,
the fifth perfect number has 8 digits,
which refutes the first hypothesis of Nicomachus.
In addition, the fifth and sixth perfect numbers
end with 6,
which refutes the third hypothesis of Nicomachus
that all perfect numbers end with 6 or 8 alternately.
Two of Nicomachus' hypotheses have been proven wrong.
So what about the other three?
Two centuries later,
this problem reached Europe during the Renaissance.
Italian mathematician Pietro Cataldi
once again proved the sixth and seventh perfect numbers.
To this day,
every perfect number follows the Euclid formula
and the best way to find a new perfect number
is to find a P value where two P digits are subtracted by one,
which is the same as the prime number.
For this reason,
the French surgeon Marek Mersenne,
who was born in 1588,
began to study the shape of this number.
In 1644,
Mersenne presented his view
in a book covering a list of 11 P values.
He claimed that these values
can make two digits of P minus one
into a prime number.
The number that meets this condition
is now known as the prime number Mersenne.
In his list,
the first seven P values
produce a prime number that corresponds to the first seven perfect numbers.
However, for some larger numbers,
such as two digits of 67 minus one,
Mersenne admitted that he did not even check
whether it was a prime number.
Mersenne discussed the issue of perfect numbers
with famous figures at the time,
including Pierre de Fermat and René Descartes.
In 1638,
Descartes wrote a letter to Mersenne and said,
I think I can prove that
in addition to the Euclid formula,
there is no other formula that can produce a different perfect even number.
Descartes also argued
that if there is a perfect even number,
it must have a special shape,
i.e. a product of the prime and square numbers of other numbers.
If he is right,
then this will be the biggest error in 2,000 years since Euclid about this issue.
But Descartes could not prove these two statements.
Instead, he wrote,
in my opinion,
we can find the actual perfect odd number,
but no matter how,
finding this number will take a very long time.
The search for the prime number of Mersenne in the modern era
About a century later,
at the Saint Petersburg Academy,
a Russian mathematician named Kristian Grzbach
met a 20-year-old mathematician
who communicated through letters.
In 1729,
Grzbach introduced a mathematical research project to this young man
named Leonhard Euler.
At first, Euler seemed uninterested in the theory of numbers.
But with further encouragement from Grzbach,
he began to be interested in the theory of numbers
and spent the next 40 years studying various issues in this field
One of them is the issue of perfect numbers.
Euler continued Descartes' work and achieved greater success.
In the process,
he made two important breakthroughs in the study of perfect numbers.
In 1732, Euler found the eighth perfect number.
He found it by proving
that 2 to the power of 31 minus 1 is the prime number
To achieve other breakthroughs,
Euler created a new tool called the sigma function.
This function is responsible for taking all the factors of a number,
including the number itself,
then summing it up.
For example, sigma 6
6 is equal to 1 plus 2 plus 3 plus 6
is equal to 12
If we sum up all the factors,
we get the number 12
which is 2 times the number 6 itself.
For all perfect numbers,
the result of the sigma function is always 2 times the number
which seems to be a small change but turns out to be very strong.
Next, let's look at some examples of prime numbers 7
which only have the factor 1 and the prime number 7 itself.
So, sigma 7 is 1 plus 7 is equal to 8
and 8 is not 2 times 7
so 7 is not a perfect number.
Now let's apply this function to other numbers
for example 20
sigma 20
which is the sum of all its factors
which is 1 plus 2
4, 5, 10 and 20
the result is 42
Because 42 is not 2 times 20
then 20 is also not a perfect number.
By using this new function to do continuous deduction
Euler reached the second breakthrough
he managed to do something that Descartes could not do
he proved that every perfect number is perfect
according to the shape found by Euclides
Euler's discovery solved the problem that had existed for 1,600 years
and proved the fourth hypothesis of Nicomachus
For the next 150 years
research on perfect numbers
almost did not experience a new advancement
and no new perfect numbers were found
British mathematician Peter Barlow
wrote that the eighth perfect number found by Euler
is the largest perfect number ever found
and because these numbers only arouse a desire to know without practical benefits
there is no way anyone will try to find a larger perfect number
But Barlow was wrong
Mathematicians continue to look for perfect numbers that are difficult to find
and most of them start with a list of perfect numbers proposed by Mersenne
The next number in Mersenne's list is 2 to the power of 67 minus 1
230 years after Mersenne published his P value list
Edward Lucas, who was born in 1842
proved that 2 to the power of 67 minus 1 is not a perfect number
even though he could not find the factor
27 years later
Frank Nelson Cole quietly gave a lecture at the American Mathematical Society
He walked to one side of the blackboard and wrote 2 to the power of 67 minus 1
equal to 147.573.952.589.676.412.927
Then he walked to the other side of the blackboard and wrote
193.707.721.761.838.257.287
And the result is the same as 147.573.952.589.676.412.927
After that, he sat without saying anything
and the audience applauded
Recently, Cole admitted that he spent three years working every week
to solve this problem
although with a modern computer
this problem can be solved in less than a second
From 510 BC to 1952
people only found 12 Mersenne numbers
so there are only 12 perfect numbers that are known
The search for Mersenne prime numbers in the modern era
The main difficulty in finding Mersenne prime numbers
is to check whether the large number of Mersenne is really a prime number
In 1952, American mathematician Raphael Robinson
wrote a computer program to perform this task on the early digital electronic computer
SWAC
as soon as possible
In 10 months, he found 5 Mersenne prime numbers
and the correct number
In the next 50 years, Mersenne prime numbers were found quickly
and all using computers
At the end of 1952, the largest Mersenne prime number
was 2281 minus 1
with a length of 687 digits
At the end of 1994
the largest Mersenne prime number
was 859,433 minus 1
with a length of 258,716 digits
Because these numbers are very large
the task of finding prime numbers that are longer is more difficult
even for supercomputers
Therefore, in 1996
computer scientist George Wortmann
launched a search project for large Mersenne prime numbers through the internet
known as GIMPS
Great Internet Mersenne Frame Search
GIMPS
Divides the work of many computers
allows anyone to use their computer skills
to help find Mersenne prime numbers
This project has managed to find 17 new Mersenne prime numbers
15 of which are the largest prime numbers known at the time
and all the findings are given as a gift
If your computer finds a new Mersenne prime number
you will be recognized as the finder
and added to a list of the best mathematicians in history
In 2000, Nayan Hajratwala from Michigan A.S.
found the 38th Mersenne prime number
He also received a gift of USD 50,000
for finding the first Mersenne prime number
which has more than 1 million digits
In the future, the finder of the 11th Mersenne prime number
is likely to receive a gift of USD 250,000
In 2017, a church deacon named John Pes
used GIMPS to find the 50th Mersenne prime number
which is 2 77 232 917 minus 1
with a length of more than 23 million digits
This is the largest Mersenne prime number known at the time
If this number is printed with an ordinary A4 font
the length will be more than 70 kilometers
To celebrate this achievement
Japanese author Nanai Rosa
published a book entitled
The largest Mersenne prime number of 2017
which only contains numbers but contains 719 pages
This book quickly climbed to the first rank on Amazon
and sold out in 4 days
A year later, the 51st Mersenne prime number was found
which is 2 82 589 933 minus 1
with more than 200 million digits
Until today, this is still the largest Mersenne prime number known
Although computers have achieved extraordinary success
in finding new Mersenne prime numbers
and the perfect number
But until now
we have only found 51 Mersenne prime numbers
This shows that the number of perfect numbers may be limited
which means the fifth hypothesis of Nicomachus may be wrong
and maybe there is no perfect number that is not reached
The Mersenne prime number is very large and rare
so it takes a lot of time and computer power to find it
The oldest mathematical problem that has not been solved
Until now, there is one problem in the topic of perfect numbers that has not been solved
which is also considered to be one of the oldest problems in mathematics
Is there a perfect number in the form of a ring?
The simplest way to solve this problem is by finding an example
so that we can check various ring numbers
to see if one of them is a perfect number
This is what researchers tried in 1991
They used a clever algorithm called chain factor
to prove that if there is a perfect number of rings
then it must be larger than 10 to the power of 300
21 years later
Pascal Locambe and Michael Rowe
increased the limit to 10 to the power of 1500
and the latest advances have pushed this number to 10 to the power of 2200
For this large number
mathematicians have done extensive research using computers
but so far have not found a perfect ring number
Currently, the general view among mathematicians
is that there is no perfect ring number
This is an argument called a heuristic argument
similar to the Fermi paradox
If there is a perfect ring number, why don't we find it?
Of course, this is not a formal proof
so the existence of a perfect ring number is still one of the oldest problems
that has not been solved in mathematics
As Euler said
whether or not there is a perfect ring number
is the most difficult problem
meaning to find a perfect number
Then, does the problem of perfect numbers have an application in real life?
Not yet
Many people may think that if there is no practical application in the real world
then researching this is useless
But that kind of thinking is wrong
Why do some people care about old problems that have not been solved?
For example, for more than 2000 years
the theory of numbers does not have a practical application in the real world
This theory is just the result of mathematicians following their desire
solving interesting problems that they find
proving various results
and building a mathematical model that seems useless
But in the 20th century
we realized that we can use this model
to develop our cryptography
which is important to protect everything from personal information to government secrets
As long as there is a group of people who focus on solving a problem
there is always a good result
I found 999 ways to not make a mistake
but in the end I found a successful way
Mathematics is the same
when we face a problem and try hard to solve it
in the end we will get something useful for humans from the process
Einstein's General Relativity Theory
based on non-Euclidean geometry
which was initially developed only to satisfy curiosity
and develop intelligence
without anyone predicting that one day that geometry
will change the way we understand the universe
Thank you for your attention