@yasir.khan20743: زندگی نے ہر موڑ پر کچھ نہ کچھ سکھایا ہے، کبھی ہنسایا ہے، کبھی بہت رلایا ہے۔ وقت بدلتا رہتا ہے، یہ یاد رکھنا، اندھیری رات کے بعد ہی نیا سویرا آیا ہے۔ RePoST💕👥#@𝙐𝙕𝒂𝒊𝙍 @M u j e e b ❤️‍🔥 @Abdullah Khan67

༶•┈┈⛧┈♛ 𝑌𝑎𝑆𝑖𝑅𝑜𝑂 ♛┈⛧┈┈•༶
༶•┈┈⛧┈♛ 𝑌𝑎𝑆𝑖𝑅𝑜𝑂 ♛┈⛧┈┈•༶
Open In TikTok:
Region: PK
Thursday 16 July 2026 05:22:50 GMT
173
78
32
60

Music

Download

Comments

sarkarhamxo
♛𝙷Ꮶ♛𝒟á𝓇𝑤ԑšⲏ🥂🍂 :
رور❤️
2026-07-16 12:19:31
1
its_shaayan.uddin
💔RUMI BRAND💔 :
zamung garhai kho paki raghalaidai😂😂
2026-07-16 06:37:11
1
its_qasoo0
𝐖𝐚𝐪𝐚𝐬 𝐤𝐡𝐚𝐧♛🚩 :
jHoN____🍫💝
2026-07-16 06:48:17
1
nomankhan47noman47
N:K::47 :
Khog ror 🖤🖤
2026-07-16 06:05:00
1
user498905473
ZoXs :
mashallah🔥
2026-07-16 06:54:53
1
uzair.khn13
𝙐𝙕𝒂𝒊𝙍 :
❤️❤️❤️
2026-07-16 09:23:48
1
akhtar.ali8057
sufainoo :
❤️❤️❤️
2026-07-16 05:32:40
1
zaid__bacha
⚜️𝔽𝕔 𝕏𝕒𝕚𝔻𝕠𝕆 𝟘𝟙😈 :
❤️❤️❤️
2026-07-16 05:32:23
1
anwar0o
ᗩᑎᗯᗩᖇOO🫀😎 :
❤️❤️❤️
2026-07-16 09:58:17
0
imran.khan474747
🚩B. A. G. H. l Ak 47🇻🇳 :
❤️❤️❤️
2026-07-16 08:33:56
0
qadarkhan338
Qadar Khan :
🖤🖤🖤
2026-07-16 05:58:43
1
imranbacha13
Imran BacHa :
❤️❤️❤️
2026-07-16 08:53:11
0
ahad0o1
𝖆𝖍𝖆𝖉 👾 :
🥰🥰🥰
2026-07-16 08:05:25
0
imadkhan8279
🎋I.k🎋 :
🥰🥰🥰
2026-07-16 08:00:11
0
ashrafbacha83
Ashraf Bacha CR7 :
🥰🥰🥰
2026-07-16 07:58:12
0
zuhaibshah040
ZuHaiB ShaH :
❤️❤️❤️
2026-07-16 06:21:56
0
adilkkhan32
/عادل ملنگ/ :
🥰🥰🥰
2026-07-16 07:31:45
0
maaz.afghan
معاذ بمیخیل❤‍🔥 :
💖💖💖
2026-07-16 06:40:28
0
itx__sudais__karam
⚽CR7 سد یس🖤 :
💖💖💖
2026-07-16 06:54:18
0
zuhaibshah040
ZuHaiB ShaH :
🥰🥰🥰
2026-07-16 06:22:00
0
marwan.khan089
🍁pEeRiSTaN🍁 :
❤️❤️❤️
2026-07-16 08:15:39
0
its_shaayan.uddin
💔RUMI BRAND💔 :
🥰🥰🥰
2026-07-16 06:36:17
0
bkmalang302
🚬🍷BADNAM ALAK 🍷⛓ :
❤️❤️❤️
2026-07-16 05:28:15
1
rahmanalichand
رحمان علی چاند♥️ :
❤️😅
2026-07-16 05:58:38
0
jawadkhan22928
❕786🦂مست ملنگ 🦂 :
🖤🖤🖤
2026-07-16 05:35:23
0
To see more videos from user @yasir.khan20743, please go to the Tikwm homepage.

Other Videos

Graham's number is an astronomically large, finite integer that famously became known as the largest number ever used in a serious mathematical proof (though even larger numbers have since been used). It was introduced by mathematician Ronald Graham in the 1970s as an **upper bound** for a specific problem in **Ramsey theory**, a branch of mathematics concerned with the emergence of order in large, complex systems. ### Why is it so special? Graham's number is so incomprehensibly large that it cannot be written down using standard scientific notation, nor can it be represented by a power tower (like 3^{3^{3^{\dots}}}) that fits within the observable universe. If you attempted to write out even a tiny fraction of its digits, you would run out of room in the observable universe long before you finished, even if you wrote each digit on a single atom. ### How is it defined? Because it is too big for standard math notation, mathematicians use **Knuth's up-arrow notation**, which builds on exponentiation.  * **Single arrow (\uparrow):** Exponentiation (3 \uparrow 3 = 3^3 = 27)  * **Double arrow (\uparrow\uparrow):** Tetration (repeated exponentiation: 3 \uparrow\uparrow 3 = 3^{3^3} = 3^{27} = 7,625,597,484,987)  * **Triple arrow (\uparrow\uparrow\uparrow):** Pentation (repeating the double-arrow operation) Graham's number is reached through a recursive process involving 64 layers of this notation.  1. Define g_1 = 3 \uparrow\uparrow\uparrow\uparrow 3.  2. Define g_2 = 3 \uparrow^{(g_1)} 3, where the number of arrows is equal to g_1.  3. Continue this process 64 times. g_{64} is Graham's number. ### The Context of the Proof Graham was working on a problem involving hypercubes in higher-dimensional space. The problem asks for the smallest dimension N such that if you connect every pair of corners of an N-dimensional hypercube and color each edge one of two colors, you are guaranteed to find a complete subgraph (a K_4) that lies on a single plane and is entirely one color. Graham proved that such an N exists, and he provided this immense number as the upper bound for the answer. While the true answer to the problem is believed to be much smaller (likely in the low double digits), Graham's number remains a testament to how rapidly certain mathematical functions can grow. To help you visualize how this scale of growth works, would you like to explore how Knuth's up-arrow notation functions step-by-step from exponentiation to higher levels?
Graham's number is an astronomically large, finite integer that famously became known as the largest number ever used in a serious mathematical proof (though even larger numbers have since been used). It was introduced by mathematician Ronald Graham in the 1970s as an **upper bound** for a specific problem in **Ramsey theory**, a branch of mathematics concerned with the emergence of order in large, complex systems. ### Why is it so special? Graham's number is so incomprehensibly large that it cannot be written down using standard scientific notation, nor can it be represented by a power tower (like 3^{3^{3^{\dots}}}) that fits within the observable universe. If you attempted to write out even a tiny fraction of its digits, you would run out of room in the observable universe long before you finished, even if you wrote each digit on a single atom. ### How is it defined? Because it is too big for standard math notation, mathematicians use **Knuth's up-arrow notation**, which builds on exponentiation. * **Single arrow (\uparrow):** Exponentiation (3 \uparrow 3 = 3^3 = 27) * **Double arrow (\uparrow\uparrow):** Tetration (repeated exponentiation: 3 \uparrow\uparrow 3 = 3^{3^3} = 3^{27} = 7,625,597,484,987) * **Triple arrow (\uparrow\uparrow\uparrow):** Pentation (repeating the double-arrow operation) Graham's number is reached through a recursive process involving 64 layers of this notation. 1. Define g_1 = 3 \uparrow\uparrow\uparrow\uparrow 3. 2. Define g_2 = 3 \uparrow^{(g_1)} 3, where the number of arrows is equal to g_1. 3. Continue this process 64 times. g_{64} is Graham's number. ### The Context of the Proof Graham was working on a problem involving hypercubes in higher-dimensional space. The problem asks for the smallest dimension N such that if you connect every pair of corners of an N-dimensional hypercube and color each edge one of two colors, you are guaranteed to find a complete subgraph (a K_4) that lies on a single plane and is entirely one color. Graham proved that such an N exists, and he provided this immense number as the upper bound for the answer. While the true answer to the problem is believed to be much smaller (likely in the low double digits), Graham's number remains a testament to how rapidly certain mathematical functions can grow. To help you visualize how this scale of growth works, would you like to explore how Knuth's up-arrow notation functions step-by-step from exponentiation to higher levels?

About