1, NP- complete problem: Whether the program is clever or not determines whether an answer can be quickly verified by internal knowledge or whether it needs a lot of time to solve without such prompt, which is regarded as one of the most prominent problems in logic and computer science. This was stated by Steven Kirk in 197 1.

2. Hodge conjecture: Mathematicians in the 20th century found a powerful method to study the shape of complex objects. The basic idea is to ask to what extent the shape of a given object can be formed by bonding simple geometric building blocks with added dimensions.

3. Poincare conjecture: If the rubber band around the surface of an apple is stretched, it can slowly move and shrink into a point without breaking or leaving the surface. On the other hand, if you imagine the same rubber belt stretching in the proper direction on the tire tread, there is no way to shrink it to a point without damaging the rubber belt or tire tread.