@_fa6imaa: #الجفيري #علي_الجفيري #الشيخ #الشيخ_علي_الجفيري #محرم #صفر #ربيع_الأول #١٤٤٦هـ #trend #ترند #fyp #explore #Iraq #Bahrain #العراق #البحرين #اكسبلور

🏴 | فّ
🏴 | فّ
Open In TikTok:
Region: BH
Wednesday 11 December 2024 19:22:55 GMT
122262
10024
35
597

Music

Download

Comments

abdullah10ramzi
موهبة كروية :
لا غاب هالصوت 🤲
2024-12-20 11:15:15
6
ertyuu189
M :
ادعولي بحق صاحب الليله أتوقف في اختباري
2026-06-12 15:26:54
2
hasnail46
hasnail46 :
شسم قصيده
2024-12-15 05:40:25
4
marianoor748
user7271559648740 :
ماشاءالله علیک
2024-12-19 18:15:19
1
zaynab7710
🕊️ ﮼عاشقه ﮼الحسين ³¹³ :
السلام عليك يا أبا الفضل العباس (سلام الله عليه) السلام عليك يا السيده زينب ( سلام الله عليها)
2024-12-17 21:55:25
1
user34082927
@zzaaiinnaabb :
الشيخ على الجفيري
2025-06-27 10:21:09
1
user961491056181
✌️قنبر ال الصدر ✌️ :
شنو اسم القارئ
2024-12-19 23:33:41
1
3etr.mastekh
عطر مستكة :
السلام عليك ياأبالفضل يااكفيل زينب سلام الله عليها
2024-12-18 13:51:55
1
a.zada3
a.zada3 :
ياعباس
2025-02-23 00:54:17
0
hatemiraqiraq
العراقي :
ياكفيل ام عون
2025-03-02 23:22:53
0
157275hsgnwu
زهـراء ! :
أصعب ودااع💔
2025-02-01 12:11:05
4
amooma_alkhayat_313
ރ FATOOMY_ALKHAYAT ރ :
💔💔🥹😔
2024-12-17 11:20:01
2
faedl.30
فاضل حبيب❤️❤️ :
💔💔💔💔💔
2024-12-17 14:25:12
2
tryrarcoffee
Rare coffee :
💔💔💔
2024-12-14 21:51:50
2
alishozab217
alishozab217 :
🥺🥺🥺
2025-01-19 01:58:40
1
hussain.491
hussain.491 :
❤🥰
2025-01-01 04:08:03
1
user6118431721418
user6118431721418 :
😢😢
2024-12-20 10:38:11
1
lix7.01
🕊️ :
😩
2024-12-21 18:21:24
1
doa889
ضحوه 🌿☕🌿 :
💔
2024-12-17 16:06:14
1
f741412
❤️💚 :
😂
2025-07-01 13:05:02
0
lqqk01
lxn90 :
🥰
2025-03-10 17:30:27
0
zouzouaraj
𝒵𝒜𝒴𝒩𝒜ℬシ🐍 :
❤️❤️❤️
2025-06-29 10:20:38
0
user5069457016252
همس الحنين :
🥰🥰🥰
2025-06-25 02:59:03
0
zahraaaljabiry
زَهْرَاء :
🖤
2025-01-28 20:31:45
0
m_15_r_0
مُصطَفى الرُوحْ :
😳😳😳
2024-12-16 16:33:18
0
To see more videos from user @_fa6imaa, please go to the Tikwm homepage.

Other Videos

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 introduced as effective bounds in mathematics, such as Skewes's bound, which in turn is much larger than a googolplex. Graham's number is so large that the observable universe is far too small to contain its ordinary digital representation, assuming that each digit occupies one Planck volume. 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.#humanity #269 #tcd  #tjd #rampage
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 introduced as effective bounds in mathematics, such as Skewes's bound, which in turn is much larger than a googolplex. Graham's number is so large that the observable universe is far too small to contain its ordinary digital representation, assuming that each digit occupies one Planck volume. 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.#humanity #269 #tcd #tjd #rampage

About