@mykogijeong: #ветроломаниме

ᴀᴅᴠᴏᴄᴀᴛᴇ
ᴀᴅᴠᴏᴄᴀᴛᴇ
Open In TikTok:
Region: BY
Saturday 17 October 2026 16:09:10 GMT
63094
4990
20
73

Music

Download

Comments

miljenko18
MILJENKO :
я смотрел, офигенное аниме
2026-10-17 17:15:49
32
julian.trigger
Julian Trigger :
Блиииин, в первой серии он такой аура был 😫😫🤌. А потом пошел май Литтл пони. дружба это чудо и тд. миня никто не любил и тд
2026-10-17 17:35:12
101
maktraher5252
макктрахер :
названіє
2026-10-17 17:20:44
3
gabimari9191
corpse :
это чисто я в школе когда я злой, меня даже 11 классики пабедить не могут я их могаю шатаю так как я абсолют ещё я гуль один раз меня толпой били и у меня стали белые волосы
2026-10-18 10:28:47
0
darkwolf_2586
Darkwolf_25 :
аниме:ветролом
2026-10-18 06:21:40
3
_ttshadow_1
_ttshadow_1 :
"Пощади меня о великий господин"
2026-10-17 20:47:04
0
glsmmmy
Gls🔞 :
гуль
2026-10-18 07:10:40
0
pem_584
Pem :
я несколько раз пересматривал
2026-10-18 08:20:44
1
krut_ysh
Krutysh :
😳😳😳
2026-10-18 07:08:52
0
To see more videos from user @mykogijeong, please go to the Tikwm homepage.

Other Videos

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
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 "64 layers of exponentiation." The operation itself becomes more powerful at every step. Interesting fact Although Graham's number is unimaginably huge, it is still a finite integer. And mathematicians can actually calculate specific digits of it using modular arithmetic. For example, its last 10 decimal digits are: \[ \boxed{2464195387} \] It was introduced to the public by mathematician Ronald Graham and popularized by Martin Gardner in Scientific American. It arose as an upper bound for a Ramsey-theory problem—not because mathematicians needed to count something physically that large. If you want, I can explain exactly what \(3↑↑↑3\), \(3↑↑↑↑3\), and \(g_1\) actually mean step-by-step, using normal numbers first. #unfreezmyaccount #viralvideo #Media #Trending #foryoupage

About