@en_tunangan_maut:

ferus
ferus
Open In TikTok:
Region: MY
Friday 11 September 2026 08:07:48 GMT
28843
2679
45
693

Music

Download

Comments

meibyors
𝖆𝖕𝖎𝖘𝖍𝖍 👻 :
maybe, for him I don't have any value early than i realize. now it's time to i step back.
2026-09-12 14:42:40
4
adam_alia2
adam_alia2 :
ya. undur diri....... tapi kalau slalu ada depan mata sakit juga walau dah sedia undur.
2026-09-12 08:43:02
11
mzomr104
MZ :
Betul… baru2 ni sapu baru memahami evolusi berkawan, tiada istilah kawan sejati cuma sekadar kawan yg berfungsi di dlm kehidupan masing2
2026-09-12 14:01:28
5
wanieajemi
Deknie00 :
Nak save tpi tk bole hm
2026-09-12 14:43:13
3
bondaaj
BONDA AJ CINTA ALIAH :
Kalau Kita Rasa Sendiri dan dah Terus terang dgn Kawan tu yg kita mcm dah x boleh Go tapi Kawan tu menafikan & buat cam biasa . Adakah Emosi sendiri je yg over camtu ?
2026-09-12 14:10:32
3
taknaktauw
Hamburger🍔 :
Allahumma soli ala Muhammad ❤️
2026-09-12 19:51:42
2
wan_amazing
🅦🅐🅝_🅐🅜🅐🅩🅘🅝🅖 :
bljr jgn terlalu sensitif tnya diri kita sendiri pulak dh brpe bnyk org yg kita tk perlu kn dlm hidup dan kita face2face ckp aku tak perlukan kau lagi dlm hidup aku....!!!!
2026-09-12 13:07:00
4
laura_ashley1001
@Laura :
Tarikh tamat itu datang tanpa sebab pun.
2026-09-11 14:27:24
7
whocare9609
✨ ᗩᑌᖇEᗰOOᑎ :
2026-09-12 14:26:20
2
feefahosman
feefah osman :
😢😢😢😢semua ada xpiry date.. sedih kn
2026-09-12 13:27:26
1
ctharabas0
siti :
Macam mana pula... Kita dah tk diperlukan lagi tapi masih lagi nk simpan.... Tk faham langsung
2026-09-12 12:57:56
1
faridahharon925
faridahharon :
btl
2026-09-12 05:06:15
1
kakluv01
LUV❤️‍🔥 :
Ada..tp sebenarnya tiada.. lebih sakit dr kehilangan..
2026-09-12 07:31:37
1
ninsninsmh
ninsninsmh :
Sedihnya
2026-09-12 15:47:13
0
lemanians69
Leman 6-9 :
terima kasih 😊
2026-09-12 16:53:48
0
akids99
AJ :
Kalau lah boleh borak macam ni.
2026-09-12 16:50:32
0
norlyidris_79
✴✧ 🎀 𝓃🍩𝓇𝐿𝒾𝒜 🎀 ✧✴ :
Yang ada tapi TAK ADA MAKNA🙌🏻
2026-09-12 13:44:03
1
zieanapinjamangomen
Zieana Basarudin :
🥰☺️🫡
2026-09-12 14:57:14
1
makngahsepet
Makngah :
always get ready for any goodbye. bila tiba masa untuk berpisah, moga kita dikenang sebagai seseorang yang pernah memberi kebaikan💚 @Sarah Atifah @Ara rose
2026-09-12 14:49:55
1
bunga__november
Dinda :
@CeoOfPari-pari @Chuyaaa 🥺
2026-09-12 17:00:34
0
alia_sam17
alia_sam17 :
@Zisty
2026-09-12 17:37:55
0
To see more videos from user @en_tunangan_maut, please go to the Tikwm homepage.

Other Videos

“Why Gary! Why!” #garypalche #tpd #hero #edit #fyp Graham's number is a very large 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.[1] Using Knuth's up-arrow notation, Graham's number is  g 64 {\displaystyle g_{64}},[2] 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.
“Why Gary! Why!” #garypalche #tpd #hero #edit #fyp Graham's number is a very large 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.[1] Using Knuth's up-arrow notation, Graham's number is g 64 {\displaystyle g_{64}},[2] 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.

About