@rrrrrrrrra_: #CapCut #talkingangela #kucingplenger #100kviews #4u

—vrraaaa
—vrraaaa
Open In TikTok:
Region: ID
Saturday 13 June 2026 15:18:49 GMT
146805
21306
897
13716

Music

Download

Comments

idk_idc_idgaf45
saańhęrr :
badaki💜
2026-06-14 07:41:13
1525
byaaa799
𝖈𝖎𝖕✰ :
pntes gw bego, fyp gw aja ginian💜
2026-06-14 12:35:52
3265
ells4ninditaa
ell🦕 :
sv nabila
2026-06-14 10:57:16
451
kirannnn138
𝒌𝒊𝒓𝒂𝒏𝒏☆ :
SV tutik 🤤💜🫰🏻
2026-06-14 13:08:14
306
r4_punzqel
𝒔𝒆𝒐𝒎𝒓𝒂𝒂 :
sv ajeng
2026-06-14 14:44:58
66
qorinurhafifah
@𝕼𝖔𝖗𝕴𝕴‧₊🍒⋅°✮ :
sv sugeng
2026-06-14 09:12:40
193
matchaliyablue
yayaa :
pelan’ my plenger💜
2026-06-14 15:03:33
38
ohiya686
𝙧𝙞𝙙𝙖𝙖 𝙥𝙡𝙚𝙣𝙜𝙚𝙧𝙧✰ :
p,maksud ngana?
2026-06-14 10:51:36
75
inisasharawr_
⋆. 𐙚 𝗌𝗄𝗒_𝗌𝗁𝖺𝖺 ☁ 𖦹๋࣭⭑ :
sv salsa
2026-06-14 12:31:56
50
naseconddd
nadlla :
sugeng lagi sugeng lagi
2026-06-14 10:08:48
18
nfitvf
ᅠᅠ⠀᠌ᅠᅠᅠᅠ⠀᠌ᅠ :
pantes gue bego tontonan gue aja gini
2026-06-14 12:44:48
57
nnaytwoo_
ig: nncsyya_ :
bl fav💜
2026-06-14 00:22:30
129
onceyo7
иля :
maaf kak telat, blm pake baju baru mandi💜
2026-06-14 13:17:09
55
020313bcsbrth
sawit :
dulu gue pernah bikin jj gini jir mana ada logo capcut nya lagi 😹
2026-06-14 12:27:12
62
To see more videos from user @rrrrrrrrra_, 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 #truecrimecommunity
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 #truecrimecommunity

About