Chapter 269: Equal Difference Prime Conjecture

Chapter 269

"Hey, is this year's Filipino Award winner strong?"

"Of course, the one I feel the weakest has 1.5 Simons. ”

"No, no, no, I think the weakest one has at least 1.7 Simons. ”

"None of the people on this year's talent list are good, not even the average of 0.8 Simon. ”

"Heh, in the future, I must become a super boss of 2.0 Simon!"

In Simon's mind, several images flashed at once.

The thought that he might become a unit of measurement in the future gave Simon a feeling of pain all over his body.

Because the picture is so beautiful, I can't imagine it.

Simon wants to go down in history, and that's right.

But not in this way.

Simon looked at Gu Lu with resentful eyes.

And Gu Lu looked like nothing had happened, staring at the stage without blinking.

"Here we go. ”

Gu Lu spoke in a low voice.

Sure enough, Konstantin on the stage had already opened the slides and projected the title of the one-hour conference report onto the screen.

When I saw the topic of Konstantin's report on this meeting, many people in the audience had their pupils shrink suddenly.

γ€ŠProof of Equivalence Prime Conjecture when K is Even》。

Translated, it is "Proof of the conjecture of equal difference prime numbers when K is an even number"!

Prime numbers have always been a common problem in the field of number theory.

For example, the famous Goldbach conjecture problem, the twin prime conjecture problem, and the Sipanta conjecture are all studied by prime numbers.

And this conjecture of equal difference primes is naturally no exception.

The conjecture of equal difference prime is a famous conjecture in the field of number theory proposed by two mathematicians in the 80s of the last century.

The content of the conjecture of equal difference primes is simple.

[There is a series of difference numbers of any length of prime!]

It's as simple as that.

What a prime number is, everyone knows.

Natural numbers that are only divisible by one and themselves are prime numbers.

And the equal difference series, I learned it in high school.

To put it simply, it is to ask if there is a series of equal differences composed entirely of primes, and the number of primes in this sequence is arbitrary.

It can be said that this conjecture of equal difference primes can be easily understood by a person with a high school education.

But it's one thing to read it, and it's another thing to prove it.

Goldbach's guess is still understandable even to schoolchildren, but hundreds of years later, the mountain still stands.

Same as Goldbach's conjecture.

Although the conjecture of equal difference primes is simple and easy to understand, it is not easy to prove.

Not to mention high school students, even master's and doctoral students, they are still helpless in the face of this level of conjecture.

As for those who want to prove it with the knowledge of elementary number theory, they can only be described by the word naΓ―ve.

As early as decades ago, the big names in the field of number theory agreed that it was 100% impossible to successfully prove the conjecture of equal difference primes.

At the very least, advanced number theory, or even more advanced and obscure knowledge and theories are required.

............

Let's talk about the place of the equal-difference prime conjecture in the world of number theory.

As mentioned before, the field of number theory has the most conjectures.

Those with names and those without names, all added together, and a rough count shows that there are at least a few thousand.

The Cohen-Lenstra conjecture, which Gu Lu overcame last year, has a name, but it is not very well-known and academically valuable.

Thousands of conjectures in the field of number theory can be simply divided into several echelons.

First echelon: the millennial conjecture and the Goldbach conjecture.

There are only three conjectures in the first echelon.

Goldbach conjecture, Riemann conjecture, BSD conjecture.

Among them, the Riemann conjecture is the most difficult, but the Goldbach conjecture is the most well-known.

The second echelon is a world-class conjecture that is slightly inferior to the above three conjectures.

There are almost a dozen conjectures in this echelon.

Including ABC conjecture, twin prime conjecture, hail conjecture (Kakutani conjecture), Sipanta conjecture, equal difference prime conjecture, etc.

The conjecture of equal difference primes, among the dozen conjectures in the second echelon, is probably ranked in the bottom few positions.

However, this does not in any way affect the importance of the conjecture of equal primes.

After all, in the entire field of number theory, there are thousands of conjectures, large and small.

The conjecture of equal difference primes is enough to rank in the top 20.

In the field of number theory, there is no shortage of mathematicians who focus on the conjecture of equal difference primes.

But its progress is enough to be described as slow.

But today, Konstantin threw a bombshell.

When K is even, the contour of the equidifference prime is proved?

Although there are also cases where K is an odd number.

Konstantin can only say that he succeeded in proving half of the conjecture of equal difference primes.

It is undeniable that Konstantin has taken a big step in the direction of the conjecture of equal difference primes.

Perhaps, given Konstantin a little more time, he can really prove the full version of the conjecture of equal difference primes.

............

After a brief flash of this in their minds, everyone sat upright one by one, ready to listen to Konstantin's report on the meeting.

Konstantin standing on the stage still had such an indifferent face.

His eyes lightly swept the crowd in the audience and spoke softly.

"What I'm going to talk about today is the proof of the conjecture of equal difference prime numbers in the case of K equals even numbers. ”

"Let's start with the simplest question, whether there is a series of equal differences composed entirely of prime numbers, and the number of prime numbers is 4, 6, 8, 10......"

"With a supercomputer, we can find these series of equals very easily. ”

"But supercomputers are not a panacea, and when the K is around 100, the process is very difficult to continue. ”

"Therefore, there is no way to take a shortcut. We must use a logical and meticulous derivation process to overcome the conjecture of equal difference primes, which was left to us by the mathematicians of the last century. ”

After more than half a year of derivation and argumentation, I have found a way to prove that when K is an even number, the conjecture of equal difference prime holds, and now, let me tell you about the specific proof process. ”

Konstantin instantly entered the state, facing the direct gaze of more than 5,000 people in the audience, his expression was calm, and he spoke unhurriedly.

β€œβ€¦β€¦ Prime numbers greater than 2 are naturally divided into two categories, i.e., of the form 4N+1 or 4N-1, since the first group is the sum of two squares, but the latter is completely excluded from this property: the reciprocal series formed by these two classes, namely: 1/5+1/13+1/1/17+1/29+, etc., and 1/3+1/7+1/11+1/19+1/23+, etc., are equally infinite and have the same property from all types of primes. ”

β€œ......”

Time passes slowly.

At about forty-five minutes, Konstantin finished his report.

Let's move on to the Q&A session.

"Mathematicians with questions, please raise your hand and ask questions!"

As soon as the words fell, I saw a hand raised in the fourth row of the conference room.

............

PS: The update is estimated to be delayed in the next few days, so I hope you know.