@luluusantos1_:

kpbfrasesss
kpbfrasesss
Open In TikTok:
Region: PT
Monday 17 March 2025 22:01:33 GMT
502028
69382
557
18992

Music

Download

Comments

s.mourwa
moura 🍒 :
nossa então fica me olhando a aula toda💔
2025-04-04 21:45:30
48
eamayrao
' Lyse ! :
aí mandei veyr
2025-05-19 07:40:31
50
isa01_.1
isa :
ele e minha "amiga" tá muito estranhos e eu sei onde isso vai chegar...
2025-05-02 23:51:47
25
cayuan_021
Cayuan :
vontade de mandar pra ela 😞
2025-04-09 21:05:06
47
chefinha75
chefin4a-²⁴⁴ :
e a resposta sempre vai ser n eu que sou idiota msm
2026-05-27 02:50:19
1
larissavargasx
️🎸 :
Mandei, a resposta foi triste
2025-12-07 04:59:54
2
tamyressuellens
🏹🪶 :
eu msm respondo por ele "NÃO"
2025-04-09 19:34:14
15
wrslicee0.2
🦉☆ :
nossa né
2025-10-09 00:26:49
3
anaescura122
Nana✨️ :
ele só fala "depende" da vontade de chorar😭😭
2025-07-01 13:01:30
40
_dinizxz
𝑩𝒆𝒂𝒕𝒓𝒊𝒛⋆ :
ahh eu so queria saber 😭😭
2025-06-26 02:04:05
5
manu_xzy0
manutella🍫 :
Mandei( tô esperando um nn )
2025-04-11 23:31:45
4
notgoo0d_
🦇. :
se quisesse não haveria dúvidas 😔
2025-04-05 06:39:45
8
lyna31026
Lyna :
quem vai ser a corajosa que vai repúblicar por nós?
2025-10-09 18:44:12
1
usuariodesativado.o
🦖 :
ele me mandou, socorro
2025-05-03 10:16:41
3
hyloisy
cristina :
MANDEI AMIGAS SOCORRO
2025-11-11 01:08:08
9
_eduardo.sz
eduardo sz :
Ela me bloqueou 💔
2025-04-07 18:41:51
9
_anycamposs
￴￴ ￴￴￴ ￴￴ ￴￴￴￴ ￴￴ ￴￴ ￴￴ :
será q mando amgs?
2025-09-17 06:26:19
64
chefinha75
chefin4a-²⁴⁴ :
tava olhando meus replubicado n lembro de ter replubicado esse mas coloquei no topo ✌
2026-06-02 22:12:17
1
ey_.manuxz_
manu?¿ :
eu mandei e ele respondeu "nao" 💔😭
2025-11-16 21:09:19
4
santoss1803__
ℳ𝒶𝓃𝓊 𝑺𝓪𝓷𝓽𝓸𝓼 :
Vontade de mandar, mas sei que quando eu toco nesse assunto com ele, ele só vê a msg e ignora
2025-05-14 20:00:03
2
bagbuh_
bagbu :
amgs..mandeii
2025-12-14 02:06:40
1
.ysstriz
᧗ay ! ᩚ꣑୧ ۫ ᳝ :
mandei !
2025-08-19 22:56:58
2
beath_vg
bia💙 :
ele n quer mais releva
2025-06-12 22:37:01
1
euu_lyy
euu_lyy :
Queria tanto poder republicar 😭🙄
2025-06-14 17:05:39
1
To see more videos from user @luluusantos1_, please go to the Tikwm homepage.

Other Videos

#KAWP #dnb #tcc #based #tnd 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.[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.
#KAWP #dnb #tcc #based #tnd 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.[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