@rulasznsmitty: Just stop it #fyp #smittydarula #FYP #you #viral

♠️RulaSznSmitty🖤
♠️RulaSznSmitty🖤
Open In TikTok:
Region: US
Friday 29 May 2026 02:34:13 GMT
1399577
48608
625
14274

Music

Download

Comments

angelsrules99
Angelsrules99 :
Mind you it doesn’t affect the food at all
2026-06-12 13:59:09
4992
joewieharveykubushi
Joewie Harvey :
somebody please tell me that wasn't za😂
2026-05-29 16:15:16
3158
kyngmelz341
Kyng Melz :
I want two plates!!
2026-06-11 16:14:03
1193
queennnraerae
Rae :
I just wanna know if it works! I thank you!😁
2026-05-29 20:56:40
680
jasmyneshardai
Jasmyne Shar'Dai :
Yall this don’t infuse it 🤣
2026-06-12 23:48:01
64
creolescorpio_
Keith :
Out here full and hungry at the same time.
2026-06-10 02:34:57
587
lando..00
Landon🌵 :
Food gon stink now
2026-06-30 23:15:19
5
kelazahara
kelazahara :
😭😭😭😭😭😭 jus wasting it
2026-06-12 09:41:16
16
scottfell89
ScottX67 :
What's the point of that
2026-07-06 01:26:42
0
yengvang0101
YengVang0066 :
at this point I should be glad I'm not invited 😂
2026-07-06 04:51:18
0
perry.ross43
Perry Ross :
Are you cold
2026-07-06 12:02:07
0
chevonjones977
chevonjones4 :
that's not gonna work 😂😂😂
2026-06-12 08:20:20
16
z_riffeyyy
z_riffeyyy :
Just wasting it
2026-06-12 20:56:58
16
lightshadow4444
YT - Lightshadow4444 :
That looks fire tbh
2026-05-30 02:18:05
25
elijah2x0
Elijah 2X :
The coals were not ready first red flag
2026-06-29 13:48:48
19
amilliondreams78
Amilliondreams78 :
That doesn't work. it's not going to get you high it's going to make your chicken taste funky
2026-06-10 20:48:26
19
ren1029384756
Ren1029384756 :
What if the kids be hungry?
2026-06-11 18:51:40
179
sammy_boii02
One_of_Us :
It’s not gonna have much effect on the food
2026-05-30 13:17:37
81
s_evonnetill_
v :
that shit probably good as hell 😂😂😂
2026-06-11 13:44:18
34
To see more videos from user @rulasznsmitty, 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 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. 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 #fypシ゚ #japan #europe #save #politics
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. 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 #fypシ゚ #japan #europe #save #politics

About