Chapter 318

Before Jiang Fuyue answered, there were already people around to ridicule——

"Yes, tell us how to solve the wrong problem! Hahaha..."

"You are too bad. Can you solve the wrong problem? The answer is not wrong plus wrong?"

"That's just right. It's a terrible mistake!"

"Hahaha..."

There was laughter and ridicule.

Fan Ye's cheeks flushed with anger: "I don't know the result yet. How can they say so -"

Then the little fist was clenched.

Gao Zhaoming was terrified and thought that she would rush up and turn over the most noisy ones in the next second. It's no good!

Quickly advised: "don't be angry, don't be angry, and then hit them in the face when the results come out. Cough... Don't be impulsive, there are so many people on the scene..."

Fan Ye, let it go.

"Say, the professor has called the roll. Why don't you speak?"

"I think she's afraid?"

"If you're afraid, you'll quickly admit defeat. As a result, we don't have to wait. It's a waste of time."

“……”

Jiang Fuyue raised her eyes coldly, swept through the most violent people, and suddenly stepped forward.

The other party swallowed his saliva, "what are you doing?"

"Don't you still want to beat us? I tell you, we're not afraid!"

Say not afraid, but the fundus of the eyes has given birth to fear, and the body is Unconsciously leaning back.

Jiang Fuyue hooked her lips, collected all her cool colors, and said faintly, "excuse me, I want to use a whiteboard."

“……？”

"Don't you understand? You're in my way."

Several people stepped aside, and the crowd also separated a road from the middle. Jiang Fuyue went straight through, went to the stage, and finally stood in front of the whiteboard.

"In essence, this question is a discussion question with primary thinking of PNP."

She took off the black marker cap and turned to write——

PversusNP

The audience was dazed.

"What is this?"

"I've been learning programming since junior high school. Why haven't I ever heard of it?"

"Is it difficult?"

"I don't know."

“……”

Immediately someone took out his mobile phone, clicked on the browser and began to check the data.

Jiang Fuyue said, "in 1971, Stephen cook and Leonid Levin independently raised the question of whether two complexity classes P and NP are identical, that is, whether P is equal to NP?"

"In short, P refers to the problem that can be solved quickly by computer, and NP refers to the problem that we want to find the optimal solution. If P = NP, we will easily find the solution of any given problem. [1]"

"This means that the society we know will undergo great changes, and the automation of all tasks in medicine, science, entertainment and human society will immediately make a qualitative leap."

"Let me give an example. On the issue of how to treat lung cancer, we have P treatment schemes, which are processed by computer. Once P = NP, NP is the best scheme we want to find."

Jiang Fuyue: "the above is the essential information conveyed by the title stem. You think it is wrong because this problem has not been solved until now."

The clay Institute of mathematics in M country announced seven difficult problems on May 24, 2000. PNP problems rank ahead of Hodge conjecture, Poincare conjecture, Riemann conjecture, Yang mills existence and mass gap.

These problems echo the 23 historical mathematical problems put forward by mathematician David Hilbert of country D in Paris in 1900.

"... of course, after a hundred years, many of these 23 problems have been solved. The solution of the problems of the Millennium award is a continuation of the past and an enlightenment. It is very likely to bring breakthroughs to modern cryptography, aerospace, communications and other fields."

After listening to the explanation, everyone seemed more confused.

Didn't they just do an IOI competition question? How, how is it related to cryptography, aerospace, and the degree of automation of human society?

Gudong——

Gao Zhaoming swallowed his saliva. "Suddenly he felt unworthy."

Huang Hui turned his head and looked at him: "who isn't?"

"What the hell? Why did you use this unsolved mystery as a competition question for us? Is the person who wrote the question crazy, or am I floating?"

"Don't take it out of context. The problem is not to let you prove P = NP, but the thinking of the optimal solution of this complexity is essentially different."

"No wonder the test run is so long. The optimal solution NP is selected from P. the amount of calculation and complexity can be imagined."

"What's the matter with everyone? Don't be misled by her words! Even if this question is right, it is beyond the outline and should not appear in the examination questions of IOI."

But some people looked up the information and went back slowly——

"Not super class."

"What?"

"This is the knowledge in the field of computational complexity theory in theoretical informatics. It is on the examination outline. If you don't believe it, turn it over."

"Are you stupid?" the blonde man who took the lead in picky eating gnashed his teeth. "No, we all get zero points! Don't think about any gold medals!"

"But the facts are in front of us."

Everyone was speechless.

Just then, the test run results came out