"Zhiwen, why are you targeting me? Didn't I say I wanted to participate in the ACM World Programming Competition? Wu Zhe made a joke about Shen Zhiwen.

Shen Zhiwen didn't reply, and stared straight at Wu Zhe with his eyes. Being stared at by Shen Zhiwen like this, Wu Zhe could only surrender.

"Zhiwen, this is your attitude towards asking someone to help? It's all about to catch up with the threat. Wu Zhe said with a smile.

While laughing, Wang Chao scolded: "Dig a groove." "I saw that the computer crashed and the screen went black.

"Wang Dashao, what are you doing again? Watching a little movie? You're still young, don't get those who don't? Huang Minghai laughed at Wang Chao.

But even though it's a joke, a few people are still curious. After all, the computer is equipped by Shen Zhiwen, a master, with high configuration, and the protection of his dormitory is Chen Xu written by Shen Zhiwen and Wu Zhe themselves, and Wang Chao's computer level is not low. If it is said that it is a computer virus and someone hacked, it is impossible that Wang Chao did not even react at all.

"Phew, you're just watching a little movie? I ran the program I wrote, but I didn't expect it to work just after running. I can't find a reason for this. Wang Chao said with a flushed face. Damn, I'm a genius myself! Writing a program can bring yourself down, and it's no wonder that Wang Chao doesn't blush.

"Zhiwen, come and help me see, what the hell is this?" I really couldn't find the reason, and Wang Chao could only find Shen Zhiwen.

Shen Zhiwen leaned over to take a look, and then carefully checked it again. Hit the confirm button to run, but the computer is still down.

I checked inside and out, but I didn't find anything wrong. But as long as the program written by Wang Chao is run, it will go down, but Shen Zhiwen checked the code, the logic is clear, and the coding is no problem. The system didn't report an error, but it just didn't work. This is the first time this phenomenon has been encountered.

"Wang Chao, don't do it yet, the school selection exam is about to start. You and Wu Zhe will take the test first, and Zhiwen and I will help you see what's going on first? Huang Minghai looked at the time and said.

"Well, let's go to the exam first." Wang Chao also knows the severity.

turned around and greeted Wu Zhe again: "Let's go, Ah Zhe!" ”

"You go alone! I'm not going. Wu Zhe replied with a smile.

A few people looked at Wu Zhe with puzzled expressions, aren't you going? What is this? At that time, I spoke at Mizuki University. If Wu Zhe doesn't participate, then they won't have the face to meet people from other colleges and universities in the future.

Wu Zhe looked at the expressions of the other people, and knew that he couldn't joke anymore. said with a smile: "Two days ago, the academy informed me that I don't need to take the selection exam, and for fear of delaying the matter of Kaixin.com, I can go directly to participate in the Qiu Competition." So Wang Chao, you need to go over alone, take the test well, I'm optimistic about you! ”

“MMP！” Wang Chao just wants to scold now.

Shen Zhiwen and Huang Minghai saw that Wu Zhe would not participate in the Qiu Competition, and their hanging hearts were also relaxed. They all began to laugh at Wang Chao.

Wang Chao could only make a gesture with a middle finger before going out.

After Wu Zhe and Wang Chao went out, he also began to check the program written by Wang Chao, and the code was fine. Wu Zhe looked at it slowly, and the logic seemed to be self-consistent. Wu Zhe frowned and thought about it.

"Huh? This place looks familiar! Wu Zhe's eyes lit up, and then he looked for Wang Chao's notebook, looking at his modeling ideas, and his brain was also running at high speed.

"Zhiwen, don't be busy. I should know what the problem is. Wu Zhe said.

"What's the problem?" Shen Zhiwen asked.

"Hehe, Wang Chao's heart is too big, you look at these four indicators. Rise-fall-finish-oscillation, and then bring in other parameters to make a judgment on its rendering result. What does this judgment look like?

"Four-color conjecture?" Shen Zhiwen reacted immediately. "Damn, what does Wang Chao think. It's strange that the machine doesn't go down. ”

It is estimated that he didn't react himself, thinking that the logic was self-consistent. It's strange if it doesn't go down. The computation is too large and may require a supercomputer to complete. Wu Zhe said with a smile.

And not only did he solve a global problem of the four-color problem, but he also made a Sitapan conjecture when it came to graph theory. I don't even know if he's a genius or a fool. Two unproven conjectures can be used, and the logic is still self-consistent. I'm going to force him to prove it when I come back. Wu Zhe said fiercely.

"Why can't this be used if it hasn't been proven, and 1+1=2 hasn't been proven? It doesn't work the same way. Besides, hasn't the four-color problem been proven on the computer? Huang Minghai said beside him.

"That's just counting the four-color problem 10 billion times without making a mistake, and it's not over for a day without a mathematical logic proof." After speaking, Wu Zhe was interested, picked up a pen and scratch paper and began to prove it.

——————

In 1852, when Guthrie, a graduate of the University of London, came to work on map coloring at a scientific research institute, he found that each map could be colored in only four colors. He wondered if this phenomenon could be mathematically proven. It can only be said that he ate too much, and Guthrie and his younger brother really studied it, and finally pulled in his brother's teacher, the famous mathematician de Morgan, but several people did not study it until they died.

It was not until 1872 that Kelly, the most famous mathematician in Britain at that time, formally proposed this problem to the Mathematical Society of London, so the four-color conjecture became a concern of the world's mathematical community, and many first-class mathematicians in the world participated in the four-color conjecture conference. In 1880, mathematicians used the fallacy to prove that if there was a regular five-color map, there would be a "very small regular five-color map" with the least number of countries, and if there was a country with less than six neighbors in a very small regular five-color map, there would be a regular map with a small number of countries still being five-colored, so that there would be no number of countries with a very small five-color map, and there would be no regular five-color map. So Kemp thinks he's proven the "four-color problem", but it turns out he's wrong.

In 1922, Franklin proved that every map with up to 25 countries could be colored in four colors. In 1926 Reynold extended this result to 27 countries, and then in 1938 Franklin set a record of 31 countries. After Wynn proved 35 countries in 1940, research stalled until 1970, when Orr and Staple proved the four-color theorem on all maps of up to 40 countries. Before Haken and Appel finally proved the four-color theorem and overshadowed all such results, the number was 96.

In 1950, the German mathematician Schich estimated that the four-color conjecture would involve about 10,000 different configurations. Although his estimate later proved to be exaggerated, it correctly pointed out that the four-color problem could only be solved with the help of powerful computing devices capable of processing large amounts of data.

In 1972, Haken teamed up with Appel, and after four years of intense work, in June 1976 they spent 1,200 computer hours on three computers and processed more than 2,000 configurations to verify that the four-color problem was true. But for mathematicians, it is certainly not satisfied.

——————

Wu Zhe first started with the coloring judgment problem: if it is known that a graph g is only allowed to use these m colors to color the nodes of g, can any two adjacent nodes in the graph have different colors?

Then, from the m-coloring optimization problem, the smallest integer m that can be used to color graph g is obtained. This integer is called the color number of Figure g. This is the least coloring problem for finding the graph to find the value of m.

for(i = 1m= n; i++)

a＾r/(a-b)(a-c)+b＾r/(b-c)(b-a)+c＾r/(c-a)(c-b)

When r=0,1, the value of the equation is 0, when r=2 is 1, and when r=3, the value is a+b+c

……

V+F-E=X§, V is the number of vertices of polyhedron P, F is the number of faces of polyhedron P, E is the number of edges of polyhedron P, and X§ is the Eulerian indicative number of polyhedron P.

If P can be homomorphic on a surface (colloquially understood as being able to swell and stretch on a spherical surface), then X§=2, and if P is homoembryonic on a surface with h ring handles, then X§=2-2h.

…… e-ix=cosx-isinx, and then the method of addition and subtraction of the two formulas is used to obtain: sinx=(eix-e-ix)/(2i),cosx=(eix+e-ix)/2.

Take the x in eix=cosx+isinx as ∏ and get: e^i∏+1=0.

~~~~~~