1. Home
  2. Detail

@editorfaxama22: #دهوك #زاخو #اربيل #المانيا #saraB22 @L O R D ✪

editor Sara B22
editor Sara B22
Open In TikTok:
Region: IQ
Saturday 26 September 2026 10:50:43 GMT
13955
594
57
48

Music

Download

No Watermark .mp4 (2.63MB) No Watermark(HD) .mp4 (1.82MB) Watermark .mp4 (4.4MB) Music .mp3

Comments

b22legnd
user b22 :
2024prime💔💔
2026-09-26 13:50:34
3
aram_v77
𝗔𝗡𝗚𝗘𝗟 𝟳𝟳 ✯ :
where are you?💔
2026-09-26 21:00:20
0
vortex.458
VØRTEX x 01 :
Rasta yan na?
2026-09-26 15:32:40
2
baran22lord
TOAYTA :
LORD😭
2026-09-26 12:33:09
3
hussen.hawere
HUssin :
2026-09-26 12:31:43
2
hiwaai7
Hiwa b22 :
2026-09-26 12:01:33
1
yadb_b22
Yad b22 :
b22 💔
2026-09-26 13:52:56
2
dyiar_barzani7
Dyiar_Barzani :
2026-09-27 13:09:48
1
user7318587741002
ديندار عثمان :
2026-09-26 10:55:51
2
kdhsosho
malash🩷 :
😭😭😭خودئ دگه له ته بيت لورد😭😭💔💔💔
2026-09-26 13:19:25
1
.barca_8
🤎✨دلشـآد/𝐷𝑖𝑙𝑠ℎ𝑎𝑑 :
2026-09-26 11:16:35
2
kdhsosho
malash🩷 :
2026-09-26 13:19:48
1
ne_x80
𝑋𝐴𝑇𝐴𝑅 :
💔🥹❤️‍🔥
2026-09-26 17:10:09
1
4k_dusky
AKAN :
2026-09-26 15:53:27
1
yosf_navdari13
yosf :
2026-09-26 11:15:26
1
hanuzaox57
يديتور💙هارون :
💔🙂
2026-09-26 20:37:55
0
yusuf.slvaney2
yosf_b22 :
اخ اخ لورد😭😭😭😭😭😭
2026-09-26 20:29:55
0
hama.zebari47
حه مه. زيباري ⚜️🦅 :
🥺🥺🥺
2026-09-27 09:18:02
0
its.lilly778
𝓚 ღ :
2026-09-27 17:03:29
0
m7ee_20
M7eeyykabus04 :
2026-09-26 16:51:10
0
tiktokqueen787
ملكة تيك توك👸🏻❤️ 𒀭 :
💔😞😭
2026-09-26 16:46:00
1
sievanay1
🔥 Abdrhman Slivanay🔥 :
فه خامه نه 🥲💔
2026-09-27 07:13:26
0
lozandhoke1
lozandhoke :
نه نه نه. ترا نه نه
2026-09-26 19:42:11
0
ezdi041
୨୧ 𝑲𝑵𝑬 ୨୧ :
2026-09-26 17:15:40
0
yosf_navdari13
yosf :
2026-09-26 11:15:33
0
To see more videos from user @editorfaxama22, please go to the Tikwm homepage.

Other Videos

انما ابتلاك ليقول لك عد الي عبدي فأني احبك😭😭😭❤️‍🩹 حب الله لنا#البلاء #كلام_من_ذهب #foryou #اكسبلور
انما ابتلاك ليقول لك عد الي عبدي فأني احبك😭😭😭❤️‍🩹 حب الله لنا#البلاء #كلام_من_ذهب #foryou #اكسبلور
#paratii #fyp #Viral #lyrics_47
#paratii #fyp #Viral #lyrics_47
WOW😱 How to make a Spider-Man web-shooter out of a Coca-Cola bottle cap. Tutorial
WOW😱 How to make a Spider-Man web-shooter out of a Coca-Cola bottle cap. Tutorial
**Graham's number** ($G$) is an immensely large integer that arose as an upper bound for a problem in Ramsey theory (a branch of combinatorics). Discovered by mathematician Ronald Graham in 1977, it was once recognized by the *Guinness Book of World Records* as the largest explicit positive integer ever used in a serious mathematical proof. It is so large that it cannot be written in conventional notation, sci-notation, or power towers. It is far larger than physical quantities like the number of Planck volumes in the observable universe ($\sim 10^{185}$). --- ## The Mathematical Origin Graham’s number connects to a problem involving hypercubes (higher-dimensional cubes): > Connect all pairs of vertices of an $n$-dimensional hypercube to form a complete graph $K_{2^n}$. Color every edge either red or blue. What is the smallest dimension $n$ such that **every** possible 2-coloring guarantees at least one single-color 4-vertex coplanar subgraph? Ronald Graham proved that such a dimension exists and established an upper bound to bound the problem. That upper bound is Graham's number. *(Note: The actual bound needed for the problem is believed to be much smaller—mathematicians suspect it could be as small as 13, but Graham's number was the upper limit proven mathematically at the time.)* --- ## How Graham's Number Is Constructed To express Graham's number, standard exponential notation fails. Instead, it uses **Knuth's up-arrow notation**: * **1 Arrow (Exponentiation):** $$3 \uparrow 3 = 3^3 = 27$$ * **2 Arrows (Tetration - Power Towers):** $$3 \uparrow\uparrow 3 = 3 \uparrow (3 \uparrow 3) = 3^{27} = 7,625,597,484,987$$ * **3 Arrows (Pentation):** $$3 \uparrow\uparrow\uparrow 3 = 3 \uparrow\uparrow (3 \uparrow\uparrow 3) = \underbrace{3^{3^{3^{\cdot^{\cdot^{\cdot^3}}}}}}_{7,625,597,484,987 \text{ threes}}$$ This forms a power tower of 3s that is over 7.6 trillion 3s high. --- ### The 64-Step Sequence Graham's number ($G$) is defined using a recursive sequence of 64 levels ($g_1, g_2, \dots, g_{64}$): 1. **Level 1 ($g_1$):** $$g_1 = 3 \uparrow\uparrow\uparrow\uparrow 3 = 3 \uparrow\uparrow\uparrow (3 \uparrow\uparrow\uparrow 3)$$ *(This value alone vastly exceeds the total number of subatomic particles in the observable universe.)* 2. **Level 2 ($g_2$):** $$g_2 = 3 \underbrace{\uparrow \uparrow \dots \dots \uparrow}_{g_1 \text{ arrows}} 3$$ *(The number of arrows in level 2 is equal to the full value of $g_1$.)* 3. **Level 3 ($g_3$):** $$g_3 = 3 \underbrace{\uparrow \uparrow \dots \dots \uparrow}_{g_2 \text{ arrows}} 3$$ 4. **Iterate until Level 64 ($g_{64}$):** $$G = g_{64} = 3 \underbrace{\uparrow \uparrow \dots \dots \uparrow}_{g_{63} \text{ arrows}} 3$$ --- ## Mind-Boggling Scale & Properties * **Information Density Limit:** Trying to store all the digits of Graham's number in your head would require so much information density that your brain would collapse into a black hole. * **Known Digits:** Although we cannot write out the entire number, modulo arithmetic allows us to determine its final digits. The last 10 digits of Graham's number are: $$\dots 2464195387$$ #grahamnumbers #truecringecommunnity #kerchpolytechniccollege
**Graham's number** ($G$) is an immensely large integer that arose as an upper bound for a problem in Ramsey theory (a branch of combinatorics). Discovered by mathematician Ronald Graham in 1977, it was once recognized by the *Guinness Book of World Records* as the largest explicit positive integer ever used in a serious mathematical proof. It is so large that it cannot be written in conventional notation, sci-notation, or power towers. It is far larger than physical quantities like the number of Planck volumes in the observable universe ($\sim 10^{185}$). --- ## The Mathematical Origin Graham’s number connects to a problem involving hypercubes (higher-dimensional cubes): > Connect all pairs of vertices of an $n$-dimensional hypercube to form a complete graph $K_{2^n}$. Color every edge either red or blue. What is the smallest dimension $n$ such that **every** possible 2-coloring guarantees at least one single-color 4-vertex coplanar subgraph? Ronald Graham proved that such a dimension exists and established an upper bound to bound the problem. That upper bound is Graham's number. *(Note: The actual bound needed for the problem is believed to be much smaller—mathematicians suspect it could be as small as 13, but Graham's number was the upper limit proven mathematically at the time.)* --- ## How Graham's Number Is Constructed To express Graham's number, standard exponential notation fails. Instead, it uses **Knuth's up-arrow notation**: * **1 Arrow (Exponentiation):** $$3 \uparrow 3 = 3^3 = 27$$ * **2 Arrows (Tetration - Power Towers):** $$3 \uparrow\uparrow 3 = 3 \uparrow (3 \uparrow 3) = 3^{27} = 7,625,597,484,987$$ * **3 Arrows (Pentation):** $$3 \uparrow\uparrow\uparrow 3 = 3 \uparrow\uparrow (3 \uparrow\uparrow 3) = \underbrace{3^{3^{3^{\cdot^{\cdot^{\cdot^3}}}}}}_{7,625,597,484,987 \text{ threes}}$$ This forms a power tower of 3s that is over 7.6 trillion 3s high. --- ### The 64-Step Sequence Graham's number ($G$) is defined using a recursive sequence of 64 levels ($g_1, g_2, \dots, g_{64}$): 1. **Level 1 ($g_1$):** $$g_1 = 3 \uparrow\uparrow\uparrow\uparrow 3 = 3 \uparrow\uparrow\uparrow (3 \uparrow\uparrow\uparrow 3)$$ *(This value alone vastly exceeds the total number of subatomic particles in the observable universe.)* 2. **Level 2 ($g_2$):** $$g_2 = 3 \underbrace{\uparrow \uparrow \dots \dots \uparrow}_{g_1 \text{ arrows}} 3$$ *(The number of arrows in level 2 is equal to the full value of $g_1$.)* 3. **Level 3 ($g_3$):** $$g_3 = 3 \underbrace{\uparrow \uparrow \dots \dots \uparrow}_{g_2 \text{ arrows}} 3$$ 4. **Iterate until Level 64 ($g_{64}$):** $$G = g_{64} = 3 \underbrace{\uparrow \uparrow \dots \dots \uparrow}_{g_{63} \text{ arrows}} 3$$ --- ## Mind-Boggling Scale & Properties * **Information Density Limit:** Trying to store all the digits of Graham's number in your head would require so much information density that your brain would collapse into a black hole. * **Known Digits:** Although we cannot write out the entire number, modulo arithmetic allows us to determine its final digits. The last 10 digits of Graham's number are: $$\dots 2464195387$$ #grahamnumbers #truecringecommunnity #kerchpolytechniccollege


Que hago? 🫣
Que hago? 🫣

About

Legal