@lady_grinning_soul: Don’t believe what u see

Lydia Kendall-Butler
Lydia Kendall-Butler
Open In TikTok:
Region: US
Thursday 08 August 2024 18:58:36 GMT
8909435
184148
10211
96004

Music

Download

Comments

j3nna_joy
Jenna🍌🫐🍉🍋 :
Don’t worry guys his with us
2026-03-23 17:12:55
705
gabriel_famous_
★~Triton~★ :
the audio:
2026-03-11 19:17:30
4415
ilovemelaniemarti07
Kateee!!! :
I’m going to fucking bed…
2026-06-10 03:35:25
3
patchygirl._
patchygirl._ :
I can hear it now 😭
2025-05-07 19:04:20
5151
its_miazinhaa
miazinha :
hey. stop that.
2024-11-21 00:23:24
5514
k0fiu_n
K0fiu :
о имбуля
2025-05-05 13:32:36
4226
bababooeybanger
Raze :
im gonna actually cry
2024-09-09 08:23:28
1961
joel.k62
Joel.k :
2026-03-07 11:45:16
185
vianka2926
۶ৎ ѵíαղkα ༘⋆ :
quien viene del video del lavamanos roto 😔
2025-12-07 14:18:27
498
leps8642
Leps :
улыбаеться значит добрий
2024-10-14 19:10:13
1771
sakusakkkk
aisakkk :
ハエの音から来た人おらんよな
2025-02-05 06:30:34
1939
v3ng3ance.off
v3ng3ance.off :
qu'allah me pardonne
2024-12-27 21:48:03
172
melo_xxx99
Mélo :
Pardonne moi Dieu ✝️✝️
2024-10-11 18:36:59
668
bitesic
⋮ :
perdón por perrear hasta el piso
2025-01-13 00:44:37
692
ne.senexty
about :
нифига себе котята
2025-04-05 17:26:56
359
4lephnull
lenovo a5000 hype :
Аминь,извини что посмотрела мертвой душе в глаза,убереги меня и мою семью ото всех злых духов,Аминь
2025-01-05 14:52:49
780
potato_chese2
Nuggies :
Solo le falta un moñito y será extra kawaii❤️
2024-09-26 20:20:01
319
cynessaisthebest
Griefer's Number One Hater :
I see you hiding in the comments 🫵
2024-09-15 10:59:45
547
aury25268
Auroo :
protezione per me e la mia famiglia 🍀🍀🍀🍀🍀🍀🍀🍀🍀🍀🍀🍀🍀🍀
2024-12-11 19:04:20
52
To see more videos from user @lady_grinning_soul, please go to the Tikwm homepage.

Other Videos

Attemp of wave, didn't like it. . . . 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. #edit #schizowave #fedposting #dogwhistle
Attemp of wave, didn't like it. . . . 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. #edit #schizowave #fedposting #dogwhistle

About