"What do you think?" The great scholar Suradi looked at Richard and asked.
Richard looked away from the title of the papyrus scroll, his eyes flashed and he said: "22 days."
"Huh?" The great scholar Suradi was stunned, "What 22 days?"
"If you use a suitable method to answer this question - it will take up to 22 days for the fake scholar Sulla to find the thief Rady who is hiding in the secret room." Richard said.
Suradi looked at Richard for several seconds, then pondered, and nodded appreciatively for a moment: "Well, not bad, it is consistent with one of my previous guesses, yes, it is 22 God. Come on, kid, tell me your thoughts and let me see if you are different from me or think wrong."
"You can think about it this way, numbering all thirteen houses - from No. 1 to No. 13. In the question, the thief Lardy changes the rooms, either from even numbers to odd numbers - for example, from Room 1 to Room 2. Either from an odd number to an even number—for example, from room 1 to room 2.
In this way, we make two assumptions: on the first day, the thief Lardy is in the even-numbered room; or, on the first day, the thief Lardy is in the odd-numbered room.
If the thief Lardy is in the even-numbered room on the first day, then we will search room 2 on the first day, room 3 on the second day, room 4 on the third day, and search room 12 on the eleventh day. So far, there is a high chance that the thief Lucky will be found in the process. Because the distance between Sulla, the fake scholar who searched the room, and Radi, the thief, will definitely be an even number—either 0 or a multiple of 2. When the distance is 0, it means that the search is successful and the thief Ladi is caught.
And if the thief is not found in this search, it means that the thief Lardy stayed in the odd-numbered room on the first day. Then on the next day - the twelfth day, he will definitely stay in the even-numbered room. In this way, the fake scholar Sulla can go back and continue searching from Room 2. The worst case scenario is to catch the thief Radi in Room 12 on the 22nd day and get back the stolen treasure. . "
"Well..." After listening to Richard's words, the great scholar Suradi pondered for a long time, then looked at Richard and nodded, "Well, yes, your idea is very correct, almost exactly the same as mine. You... um, Wait a moment, let me write a draft of a reply to that old bastard Naya Dodd."
After saying that, the great scholar Sucrates picked up the quill, opened a new papyrus scroll, and began to write "brushing".
After a while, he was almost finished writing. Surades looked at the content, fell into deep thought again, and said to Richard: "Yaduode deliberately raised difficult questions to embarrass me, although... well, although he didn't really embarrass me, but I It would be better to answer him with a similar question.
I thought of several problems, but they were not suitable. Then do you have a suitable question, preferably one that is very difficult to answer..."
"Uh..." Richard's eyes flashed, his thoughts racing.
A very difficult problem to solve? There are too many, and what he has always wanted to know is one of them - what is the truth of this world, and what is the nature of time travel
In addition, the book spirit of "Monroe Chapter" was tested a long time ago, and several issues that have caused the book spirit to not respond so far are also included - the grand unified theory, the Riemann hypothesis, and the accurate value of pi.
However, considering these questions, he also couldn't give an answer, so it would be better to switch to a few simpler ones. For example... the Poincare Hypothesis, which is one of the seven major mathematical problems in the modern earth world along with the Riemann Hypothesis, has been successfully solved:
Any simply connected, closed three-dimensional manifold is homeomorphic to a three-dimensional sphere.
To put it simply, every closed three-dimensional object without holes is topologically equivalent to a three-dimensional sphere.
To put it simply, if there is a rubber band tied to the surface of an apple (or other spherical fruit), try to stretch it without tearing it or letting it leave the surface. You can let it slowly move and shrink to a point; But if this rubber band is tied to the surface of a tire in an appropriate manner, there is no way to shrink the rubber band to a point without pulling it away from the surface. Therefore, the surface of the apple is "simply connected", but the surface of the tire is not.
Richard was about to speak out, but he stopped when he spoke, because he suddenly thought that something about topology might be a bit too challenging to the thinking of the great scholar in front of him, Sucrates. If he really said it, he would probably need to popularize the definitions of three dimensions, manifolds, and embryos first.
So... let's change to a simpler one, preferably a purely numerical problem - a "strength problem" that has no technical content but requires a lot of calculations to complete.
So…
"You can think of it this way." Richard looked at Surades and said, "There is a special kind of number among numbers, such as 121, 363, etc. They read from left to right, which is the same as reading from right to left. , this kind of number can be called a palindrome number. And these numbers do not exist without basis. They can be split into many other numbers.
For example, if you add the number 56 to its reverse number - 65, you can get the palindrome number 121.
For another example, take the number 57 and add it to its reverse number - 75, and you will get 132. 132 is not a palindrome number, but if you continue to add it to its reverse number - 231, you will get the palindrome number 363. Number of articles.
For example, if you add the number 59 to 95, you get 154. Add 154 to 451 to get 605. Add 605 to 506 to get 1111 - another palindrome number after three iterations.
In fact, for numbers within 100, about 90% can get a palindrome number within seven iterations, and about 80% can get a palindrome number within four iterations.
Of course, there are also more iterations. For example, 89 requires 24 iterations to get the 13-digit palindrome number 8,813,200,023,188.
After exceeding 100, for example, the number 10,911 requires 55 iterations to obtain a 28-digit palindrome number - 4,668, 731, 596, 684, 224, 866, 951, 378, 664.
For super large numbers like 1,186,060, 307,891,929,990, it takes 261 iterations to get a qualified palindrome number, and the result has exceeded 100 digits, reaching 119 digits.
So is there such a number that cannot produce a palindrome number no matter how many iterations it goes through? We can call it the Licrel number. If it really exists, what is its minimum number? "
"..." The great scholar Suratis was silent for a long time. He looked at Richard, then silently walked to the desk, picked up the tea that had been brewed for some time and had already cooled down, and took a sip.
After drinking tea, the great scholar Suradi looked at Richard and nodded in agreement: "Well, it's a very good topic."
Then he asked two questions—two very serious questions.