Graham's Number
An enormous upper bound arising from a problem in Ramsey theory concerning the coloring of the vertices of a hypercube; it was long listed in the Guinness Book of Records as the largest number appearing in a mathematical proof and is defined recursively using Knuth's up-arrow notation.
Timeline (last 90 days)
BB(10) > Graham's number.
Graham's number was long listed in the Guinness records as the largest number to have appeared in a mathematical proof.
Graham's number comes from an upper bound problem in Ramsey theory about coloring the vertices of a hypercube, and is defined recursively using Knuth's up-arrow notation.
The definition of Graham's number is: g₁ = 3↑↑↑↑3, gₙ = 3 with gₙ₋₁ arrows, and Graham's number is g₆₄.
Graham's number is computable; there exists a finite algorithm that can write it out.
All Facts (5)
BB(10) > Graham's number.
50%UnverifiedGraham's number was long listed in the Guinness records as the largest number to have appeared in a mathematical proof.
50%UnverifiedGraham's number comes from an upper bound problem in Ramsey theory about coloring the vertices of a hypercube, and is defined recursively using Knuth's up-arrow notation.
50%UnverifiedThe definition of Graham's number is: g₁ = 3↑↑↑↑3, gₙ = 3 with gₙ₋₁ arrows, and Graham's number is g₆₄.
50%UnverifiedGraham's number is computable; there exists a finite algorithm that can write it out.
50%