Chapter 676 'Proof that the factorization of great positive integers has a polynomial algorithm!'
"Proof that the factorization of large positive integers has a polynomial algorithm!"
Looking at the file sent by Liu Jiaxin on his mobile phone, Xu Chuan was stunned for a moment and then reacted.
He quickly clicked on the file, downloaded it and at the same time displayed his prestige.
"Did you prove it?"
His fingers quickly tapped on the Jiugongge keyboard a few times, and a brief message was sent.
At the same time, he quickly sent the document to his assistant and sent a message: "Help me print out this document as quickly as possible and send it to my room."
After the message here was sent, the message from Liu Jiaxin over there also came back.
"Well, this method should be able to solve the factorization problem of large positive integers, but I'm not sure if there are any flaws in it. I want you to help me take a look."
Xu Chuan quickly replied: "It's being printed, I'll look at it right away."
After a pause, he added: "I'll go back tomorrow afternoon."
"It's okay. There's no need to rush. Just do your work first. Don't worry about the paper."
The message from the other side was quickly replied, but Xu Chuan no longer paid attention.
He stood up and took out his computer from his backpack, quickly opened it and uploaded the PDF paper to the computer.
Before the printed paper was delivered to him, the screen of the computer was always larger than that of the mobile phone. He could not wait to see the detailed content of such a top-level mathematics paper.
Open it, and the main topic of the paper comes into view.
"Proof that the factorization of large positive integers has a polynomial algorithm!"
The title of the paper is very straightforward, it is the first question of P=NP?, which is also a difficult problem that he and Liu Jiaxin discussed before.
However, his understanding of the P=NP? problem is not very deep.
As one of the 18 major unsolved problems in mathematics of the 20th century proposed by him, the mathematician Smail chose the following NP-complete problems derived from traditional mathematical problems as representatives of the "P=NP?" problem.
"That is: given k polynomials with respect to n variables on Z?, ask whether there is a polynomial-time algorithm to determine that they have a common zero point on (Z?)n. This description is mainly inspired by Brownwell
On the influence of Hilbert’s zero-point theorem decision algorithm.”
To put it simply, f1,···, fk are complex coefficient polynomials with n variables. According to Hilbert's zero point theorem, f1,···, fk do not have a common zero point in the complex field when and
Only if there is a complex coefficient polynomial g1,··· with n variables, gk satisfies k∑i=1·GiFi= 1.
If it is difficult to understand these professional mathematical languages, the P=NP? problem can be described in relatively popular terms and can be divided into two parts.
‘P-type problems’ and ‘NP-type problems’.
Of course, here are two simplified concepts to help understanding. They are simplifications made for simple and clear understanding without mathematical rigor and complexity.
P represents a type of problem that computers can solve very quickly. This speed has nothing to do with the computer hardware, but only depends on the convenience of the solution itself.
NP represents another type of problem, which has an optimal solution. However, for many of these problems, when the computer seeks the optimal solution, there is no fast way, and even it can only stupidly and violently try all possible combinations.
, and then find the optimal solution.
Among NP problems, the most difficult type of problem is called NPC, which is NP-complete problem.
If this is still not specific enough, let me use a small story as an example. I believe you can understand it more simply.
Suppose you are attending a grand party and want to know if there is anyone you know there.
At this time, the host of the banquet told you that you must know the lady A who is standing in the right corner of the dessert table, so you immediately scanned there and found that what he said was right, you did know her.
Therefore, through the information about the host of the banquet, you can easily determine that you know Ms. A.
But if he doesn't tell you this, you need to look around the hall and examine everyone to see if there is anyone you recognize.
Finding Ms. A through hints from the host of the banquet is a type P problem;
And if you follow his prompts and find out that you know Ms. A, it is easy to check that Ms. A is an NP problem.
In the mystery novel "The Devotion of Suspect
In fact, the mathematical community has already given the answer, P=NP? The question is placed there. It tells everyone that generating a solution to the problem usually takes more time than verifying a given solution.
For example, if you were asked to calculate the total number of atoms in the world, the problem would be very difficult or even unsolvable.
However, if someone tells you that there are 500 atoms in the world, then you can quickly verify that he is wrong. It is easy to verify, but not easy to solve. This is an NP problem.
P-type problems are a type of problems that can be solved and verified in polynomial time; NP-type problems are a type of problems that can be verified in polynomial time but it is not certain whether they can be solved in polynomial time.
Obviously, all P-type problems belong to NP-type problems, but it is impossible to determine whether NP is equal to P.
Since "P=NP?" was proposed, many attempts have been made in both the mathematics and computer fields.
To prove that P=NP, the most obvious way is to give a polynomial-time algorithm for the NP-complete problem.
But in the past few decades, a large number of mathematicians and programmers have done a lot of work to find polynomial-time algorithms for NP-complete problems, but all have failed.
Of course, there are also a large number of people trying to give P≠NP?, and even in today's mainstream mathematics and computer industry, most scholars and researchers believe that P≠NP?.
This chapter is not finished yet, please click the next page to continue reading the exciting content! The reason is very simple. If P=NP, it means that every NP problem can be transformed into P, that is, every difficult problem can eventually become a
Simple propositions that computers can quickly solve.
This means that mankind's current mathematical system, computer system, common sense... and other aspects will be subverted.
If P=NP is finally confirmed, we can convert any NP problem into a P problem. Problems that seem difficult now can be easily solved.
For example, the game of Go has the ultimate solution, the genetic code can be easily cracked in the biological field to manipulate gene sequences arbitrarily, many mathematical conjectures can be calculated and derived using computers, a large number of difficult problems have been solved, etc.
At the same time, if P=NP, this will lead to the complete failure of all encryption algorithms in a short period of time in the future. Your bank card, mobile phone password, and social account will no longer be safe. Hackers can easily enter your computer and Bitcoin.
, Blockchain, a concept that has been very popular in recent years, will become an area that no one cares about.
If P=NP, then in this universe, there must be a simple key that can solve all the problems in this world.
If such a key really exists, it probably already exists in this universe.
For example, humans may already have the ability to see everything once and for all, or certain creatures may not have to fight for survival since they are born because their algorithms are extremely good and can survive in any environment in the most efficient way.
But whether it is from intuition, philosophy, religion, or science, it is difficult for people to believe that such a shortcut to the universe exists.
To be honest, Xu Chuan does not believe that there is such a 'universal' key in the universe, but when it comes to the proof of P=NP?, even if it is a staged one, he will use the most concentrated energy to deal with it.
.
.......
The papers on the computer screen were constantly flipping, and lines of mathematical formulas and explanations flashed across Xu Chuan's eyes.
At this moment, the doorbell ding-dong-ding-dong came from outside the room.
Standing up quickly, Xu Chuan walked through the bedroom and opened the door. At the door, Tang Sijia, the life assistant who was traveling with him on a business trip, was standing at the door, holding a thick stack of newly printed documents in his hands.
"Professor, this is what you want."
Handing over the paper with the lingering warmth and fragrance of ink attached to it, Tang Sijia added: "There is a stack of unused A4 paper under the paper, and I can do the calculations for you."
Although I know that Xu Chuan usually carries a pen and some manuscript paper with her, there is no doubt that something that can be printed out as quickly as possible is extremely important.
Therefore, she was worried that the quantity of manuscript paper that this person brought with him was not enough, so she directly took a stack of blank A4 characters from the printing room and sent them over.
Sure enough, after hearing that there was a blank A4 paper attached to the paper, Xu Chuan's eyes lit up and he quickly took the paper and manuscript paper from his assistant Tang Sijia.
"very good, thank you!"
Tang Sijia smiled slightly and said: "You're welcome, Professor, if you have any other needs, just send me a message..."
On the other side, Xu Chuan didn't even hear what his little assistant said clearly, so he waved his hands impatiently, and quickly returned to the study room of the hotel room with the paper and manuscript paper in hand, without even bothering to close the door.
Outside the door, the smile on Tang Sijia's face froze for a moment, then she closed the door silently, turned around and left, and said a blessing in her heart.
Although she couldn't understand the printed paper, out of curiosity, she searched for the title of the paper on her mobile phone during the free period of printing.
The title of this paper seems to involve the P=NP? conjecture, one of the seven millennium problems.
As Xu Chuan's assistant, although she is not a mathematics major, she knows something about the field of mathematics and is very aware of the weight of each millennium problem and its impact on the country and even the world.
Any solution to the Millennium Problem can greatly promote the development of mathematics, other disciplines, and even society as a whole.
Just like the NS equation, although she couldn't understand the proof or even understand the meaning of the NS equation, she knew clearly that the solution to controllable nuclear fusion technology was based on the NS equation.
.
I hope the professor can successfully solve the P=NP? problem this time.
Looking at the figure who turned around and entered the study, Tang Sijia silently prayed in her heart.
...
In the study room, Xu Chuan didn't know that the assistant outside had so many thoughts. At this moment, all his attention was focused on the paper in his hand.
Compared with reading papers on a computer screen, he prefers this kind of knowledge that can be weighed with his hands.
[Interpretation: This article gives a method that a P-type problem can be determined or solved in polynomial time using a deterministic algorithm and its polynomial time determination algorithm. The determination equation system f1 = 0,···, fk is given
=0 There is an upper bound on the number of terms of gi in the complexity of the complex solution algorithm of the Boolean polynomial (1)...]
"...This is aimed at exploring the relationship between the complexity categories of P and NP. In a previous paper [1], we have shown that the sat CNF problem can be polynomialized to find under a special decomposition of a set
The collection specifically covers the issues and vice versa.”
"...Definition 1: G = is called a labeled multistage graph, if the following conditions are met:
1. V is a set of vertices, V=VUnUVu...UV, VnV=0,0≤ij≤L,i≠j. If u€V,0≤i≤L, the level u is at is called level i, and it is also said that u is
The vertex of level i.L is called the level of G.
2.E is a set of edges, and the edges in E are all directed edges, which are represented by triples (u, v, l). If (u, v, l) €E, 1 ≤ l ≤ L, then
ueV-1vEV. Call (u, v, l) the l-th level edge of G.
3. Both and contain only a unique vertex. The only vertex in is called the source point, denoted as S, and the only vertex in is called the sink point, denoted as D..."
4.......
.......
The paper in his hand flowed through his eyes, and Xu Chuan flipped through every sentence, every mathematical formula, and even every punctuation mark in an instant.
The factorization of integers is an easy to understand and clear problem, but it is not a simple problem.
Relatively speaking, the factorization of smaller integers is a primary school arithmetic problem, but once the number is sufficiently large, such as the factorization of a 50-digit integer, it becomes a super mathematical problem.
If we use the 'trial division method' we learned in elementary school (such as 7M((4M^2)xP^2)÷(7M^2), the result is 4MP^2), even if we use an electronic computer, a person will not be able to do it in his lifetime.
.
Even assuming that human beings have been using computers to decompose this integer using trial division from generation to generation since the birth of the computer, even though centuries have passed since the invention of the computer, this 50-digit number still cannot be decomposed.
Therefore, finding a polynomial that can complete the factorization of large positive integers in a limited time is one of the ultimate dreams of mathematicians in the field of number theory.
Including Xu Chuan himself, he has always been looking forward to someone being able to complete it. Even if it is just a step forward on this road, he is extremely looking forward to it.
"...In other words, these problems are polynomially equivalent."
"In this paper, we show that all of these algorithmic procedures have polynomial time complexity relative to the length of the input data, and find a polynomial factorization algorithm that can handle large positive integer factors."
When the last sentence came into view, Xu Chuan, who had been sitting at the desk for who knows how long, finally put down the paper in his hand, breathed a sigh of relief, and rubbed his sore lumbar spine.
Although the proof of this top-level conjecture is not something that can be completely determined after just one reading, judging from the first paper and his mathematical intuition, Liu Jiaxin did it!
