This number appears in Ramsey's theory and is described as: connect each pair of geometric vertices of an n-dimensional hypercube to get a complete graph with 2 n vertices, then fill the color of each edge of this graph with red or blue, and then find the minimum n value that makes all filling methods contain at least one monochromatic complete subgraph at the vertices of four * * * faces.
Although the upper bound is too large to be completely calculated, the last few digits of the number can be obtained through a simple algorithm, and its last ten digits are 2464 195387.
Extended data:
Other big numbers in life:
1, the number of atoms in the universe (visible universe)
The 80th power of the total number of atoms in the universe is 10. On the surface, it is easy to see how big this number is. That's because we used a scientific counting method. Increasing the index by one value and tenfold will give you an illusion.
2. The number of changes in Go
The board of Go is 19* 19, with 36 1 moves. Every move has three states: black, white and empty, so Go goes to the power of 36 1 in Method 3. If the changes in Go are only the last few situations, there are: 36 1! ("!" Representative factorial)
3. mersenne prime M7420728 1
This is the 49th mersenne prime discovered on 20 16. Mason number refers to a number with the shape of 2 p- 1, in which the exponent p is a prime number, which is often recorded as Mp. If the Mason number is also a prime number, then this number is called mersenne prime.
Baidu Encyclopedia-Ge Henry