@maulanawakeel786: Welcome back jegara♥️♥️ #Fyp #foryoupage❤️❤️ #Foryou #fyp @zaheramiri6 @Moo Army @Zoya-Mo Army 💜🦋🥀✨ @Habibnoor804 @√ریس^برباد♧مټکور🥲💀⛓️🤬🦁

𝑴𝒂𝒖𝒍𝒂𝒏𝒂 𝒘𝒂𝒌𝒆𝒆𝒍
𝑴𝒂𝒖𝒍𝒂𝒏𝒂 𝒘𝒂𝒌𝒆𝒆𝒍
Open In TikTok:
Region: US
Thursday 03 September 2026 19:29:46 GMT
40314
2803
64
251

Music

Download

Comments

khaneditar23
𝐊𝐇𝐀𝐍 𝐄𝐃𝐈𝐓𝐎𝐑🇦🇫 :
waliullha zmare
2026-09-03 19:55:38
14
official.page.90
𝄞⃝🇦🇫ᗾ០ͣៜᷫៜᷛ♡ :
قربان يي سم افغانان چى هر هيواد کوى همداسى دى خوشحاله وى ټوله رب دى نه درد وى🥺❤️
2026-09-04 01:24:11
8
momin.wafa0
Momin Wafa :
2026-09-04 07:14:39
2
mosharaf.shinwari6
mosharaf shinwari :
2026-09-04 11:47:33
0
kandahar315
Gangster Mo Army 🤍✨🥀 :
♥️♥️♥️
2026-09-04 02:01:49
1
kandahare5
Zoya-Mo Army 💜🦋🥀✨ :
♥️♥️♥️
2026-09-03 20:26:47
2
afg.sahil37
Afg Sahil :
دی ولی زمری دی بکی نه راوړی 😂😂
2026-09-03 22:06:24
4
arifkhang007
DSP 302 :
❤️❤️❤️
2026-09-04 07:10:52
1
zahid.afghan060
Zahid Afghan :
🥰🥰🥰
2026-09-04 07:18:46
1
farhadkhan6672
Farhad Khan :
🥰🥰🥰
2026-09-04 07:52:31
1
tahsillbrahimi5
.تحصیل ابراهیمی :
❤️❤️❤️
2026-09-04 07:50:06
1
saqibk932
SÄQÎB𖤇KHÃÑ࿐ :
💔💔💔
2026-09-04 05:56:55
1
ebadullahakbari2
🇦🇫EbadUllahAkbari🇨🇭 :
🥰🥰🥰
2026-09-04 07:43:55
1
dawoodwazir138
🦅 𝘿𝙖𝙬𝙤𝙤𝙤𝙙 خان 🇦🇬 :
🥰🥰🥰
2026-09-04 05:48:20
1
khankfdd0
🤬S A 🇵🇰 302🤫 :
♥️♥️♥️
2026-09-04 05:00:29
1
malang.jan0229
Malang Jan :
👍👍👍
2026-09-04 05:32:43
1
malang.jan0229
Malang Jan :
♥️♥️♥️
2026-09-04 05:32:46
1
user4776615885062
🇦🇫🎗️کوچنی🎗️جنرال🎗️🇦🇫 :
🥰🥰🥰
2026-09-04 05:37:41
1
khanshah1256
🇦🇫🥷دا ټایګر ارمی🥷🇦🇫 :
🥰🥰🥰
2026-09-04 02:30:30
1
selab.commado
Selab Commado :
🥰🥰🥰
2026-09-04 01:42:30
1
sksanan34
𝐒𝐀𝐍𝐀𝐍 ᴬᶠᵈ :
🥰🥰🥰
2026-09-04 04:01:45
1
muhammednaabi0
muhammednaabi0 :
🥀🥀🥀
2026-09-04 03:33:11
1
sweetokhan696
𝙎𝙬𝙚𝙚𝙩𝙤 𝙆𝙝𝙖𝙣 😎 :
🥰🥰🥰
2026-09-04 04:24:04
1
pathanboy7830
𝔓𝔞𝔱𝔥𝔞𝔫 𝔟𝔬𝔶❤️ :
❤️❤️❤️
2026-09-04 04:19:52
1
godblessedhaji
نعمت الله حان :
❤️❤️❤️
2026-09-04 01:28:04
1
To see more videos from user @maulanawakeel786, please go to the Tikwm homepage.

Other Videos

Based  Graham's number is an immense number that arose as an upper bound on the answer of a problem in the mathematical field of Ramsey theory. It is much larger than many other large numbers such as Skewes's number and Moser's number, both of which are in turn much, much larger than a googolplex. As with these, it is so large that the observable universe is far too small to contain an ordinary digital representation of Graham's number, assuming that each digit occupies one Planck volume, possibly the smallest measurable space. But even the number of digits in this digital representation of Graham's number would itself be a number so large that its digital representation cannot be represented in the observable universe. Nor even can the number of digits of that number—and so forth, for a number of times far exceeding the total number of Planck volumes in the observable universe. Thus, Graham's number cannot be expressed even by physical universe-scale power towers of the form  a b c ⋅ ⋅ ⋅ {\displaystyle a^{b^{c^{\cdot ^{\cdot ^{\cdot }}}}}}, even though Graham's number is indeed a power of three. However, Graham's number can be explicitly given by computable recursive formulas using Knuth's up-arrow notation or equivalent, as was done by Ronald Graham, the number's namesake. As there is a recursive formula to define it, it is much smaller than typical busy beaver numbers, the sequence of which grows faster than any computable sequence. Though too large to ever be computed in full, the sequence of digits of Graham's number can be computed explicitly via simple algorithms; the last 10 digits of Graham's number are ...2464195387. Using Knuth's up-arrow notation, Graham's number is  g 64 {\displaystyle g_{64}},[1] where g n = { 3 ↑↑↑↑ 3 , if  n = 1  and 3 ↑ g n − 1 3 , if  n ≥ 2. {\displaystyle g_{n}={\begin{cases}3\uparrow \uparrow \uparrow \uparrow 3,&{\text{if }}n=1{\text{ and}}\\3\uparrow ^{g_{n-1}}3,&{\text{if }}n\geq 2.\end{cases}}} Graham's number was used by Graham in conversations with popular science writer Martin Gardner as a simplified explanation of the upper bounds of the problem he was working on. In 1977, Gardner described the number in Scientific American, introducing it to the general public. At the time of its introduction, it was the largest specific positive integer ever to have been used in a published mathematical proof. The number was described in the 1980 Guinness Book of World Records, adding to its popular interest. Other specific integers (such as TREE(3)) known to be far larger than Graham's number have since appeared in many serious mathematical proofs, for example in connection with Harvey Friedman's various finite forms of Kruskal's theorem. Additionally, smaller upper bounds on the Ramsey theory problem from which Graham's number was derived have since been proven to be valid #History #azerbaijan🇦🇿 #kesfet #azerbaycan🇦🇿 #enverpaşa #turkish #OttomanEmpire #IsmailEnverPasha #EnverPasha #Enver #ww1 #fyp #fypシ゚viral #muslim #islam #islam☪️ #english
Based Graham's number is an immense number that arose as an upper bound on the answer of a problem in the mathematical field of Ramsey theory. It is much larger than many other large numbers such as Skewes's number and Moser's number, both of which are in turn much, much larger than a googolplex. As with these, it is so large that the observable universe is far too small to contain an ordinary digital representation of Graham's number, assuming that each digit occupies one Planck volume, possibly the smallest measurable space. But even the number of digits in this digital representation of Graham's number would itself be a number so large that its digital representation cannot be represented in the observable universe. Nor even can the number of digits of that number—and so forth, for a number of times far exceeding the total number of Planck volumes in the observable universe. Thus, Graham's number cannot be expressed even by physical universe-scale power towers of the form a b c ⋅ ⋅ ⋅ {\displaystyle a^{b^{c^{\cdot ^{\cdot ^{\cdot }}}}}}, even though Graham's number is indeed a power of three. However, Graham's number can be explicitly given by computable recursive formulas using Knuth's up-arrow notation or equivalent, as was done by Ronald Graham, the number's namesake. As there is a recursive formula to define it, it is much smaller than typical busy beaver numbers, the sequence of which grows faster than any computable sequence. Though too large to ever be computed in full, the sequence of digits of Graham's number can be computed explicitly via simple algorithms; the last 10 digits of Graham's number are ...2464195387. Using Knuth's up-arrow notation, Graham's number is g 64 {\displaystyle g_{64}},[1] where g n = { 3 ↑↑↑↑ 3 , if n = 1 and 3 ↑ g n − 1 3 , if n ≥ 2. {\displaystyle g_{n}={\begin{cases}3\uparrow \uparrow \uparrow \uparrow 3,&{\text{if }}n=1{\text{ and}}\\3\uparrow ^{g_{n-1}}3,&{\text{if }}n\geq 2.\end{cases}}} Graham's number was used by Graham in conversations with popular science writer Martin Gardner as a simplified explanation of the upper bounds of the problem he was working on. In 1977, Gardner described the number in Scientific American, introducing it to the general public. At the time of its introduction, it was the largest specific positive integer ever to have been used in a published mathematical proof. The number was described in the 1980 Guinness Book of World Records, adding to its popular interest. Other specific integers (such as TREE(3)) known to be far larger than Graham's number have since appeared in many serious mathematical proofs, for example in connection with Harvey Friedman's various finite forms of Kruskal's theorem. Additionally, smaller upper bounds on the Ramsey theory problem from which Graham's number was derived have since been proven to be valid #History #azerbaijan🇦🇿 #kesfet #azerbaycan🇦🇿 #enverpaşa #turkish #OttomanEmpire #IsmailEnverPasha #EnverPasha #Enver #ww1 #fyp #fypシ゚viral #muslim #islam #islam☪️ #english

About