Bella
Region: US
Sunday 18 October 2026 00:24:53 GMT
526
69
0
2
Music
Download
Comments
There are no more comments for this video.
To see more videos from user @definitely.not.bella123, please go to the Tikwm
homepage.
![Graham’s number is one of the most insanely large finite numbers that has appeared in serious mathematics. It came from a problem in Ramsey theory, a branch of combinatorics. The crazy part is that we don't write Graham's number using ordinary powers like \(10^{100}\). We need Knuth's up-arrow notation. 1. Start with normal powers \[ 3\uparrow3 = 3^3 = 27 \] Two arrows mean repeated exponentiation: \[ 3\uparrow\uparrow3 =3^{3^3} =3^{27} =7,625,597,484,987 \] Already ~7.6 trillion. Three arrows are dramatically larger: \[ 3\uparrow\uparrow\uparrow3 \] This means you're repeatedly building power towers. Four arrows are even more extreme: \[ 3\uparrow\uparrow\uparrow\uparrow3 \] And this isn't even Graham's number yet. 2. The insane recursive part Define: \[ g_1=3\uparrow\uparrow\uparrow\uparrow3 \] Then: \[ g_2=3\uparrow^{g_1}3 \] Meaning: put \(g_1\) arrows between the two 3s. Then: \[ g_3=3\uparrow^{g_2}3 \] Now the number of arrows itself is \(g_2\). Keep doing this: \[ g_n=3\uparrow^{g_{n-1}}3 \] until: \[ \boxed{G=g_{64}} \] That \(G\) is Graham's number. 🤯 Why it's so huge Think of the progression: Exponentiation \[ 3^3 \] ↓ Power towers \[ 3\uparrow\uparrow3 \] ↓ Repeated power towers \[ 3\uparrow\uparrow\uparrow3 \] ↓ An even higher operation \[ 3\uparrow\uparrow\uparrow\uparrow3 \] ↓ Then Graham's construction says: > Take the enormous result and use it as the number of arrows. Then take that enormous result and use it as the number of arrows. Repeat this 64 times. So it's not simply](/video/cover/7695799630096829710.webp)
