@jus.souzas: #sertanejo #foryoupage #foryou

Ju
Ju
Open In TikTok:
Region: BR
Saturday 04 July 2026 19:38:01 GMT
167356
23031
64
2019

Music

Download

Comments

jvdudu6
Jv 1410 :
Essa música vai fazer eu beber uma semana seguida
2026-07-05 16:01:24
81
battestinduda
Duda Battestin :
E quando o amor da sua vida morreu, o que desinstalar? 😭😭😭😭😭😭😭😭
2026-07-06 17:44:32
49
raquelalvesevange
Raquel Alves Evangel :
Plmds, quando lança?😭
2026-07-05 23:50:19
53
laradichav
࿊ LARA🦈 :
Acabou com meu dia 00:27🤡
2026-07-07 03:26:33
5
pedrovakula7
PedroVakula :
10:03 da segunda, obrigado!
2026-07-06 13:03:15
9
daily.gabylima
anny🪽 :
2026-07-06 21:56:50
1
aylacarvalho38
Ayla Carvalho :
Meu dia acabou de começar e já terminou 👍🏻
2026-07-07 10:31:26
1
wgabyw
werika𑁤 :
Meu Deus, essa já tá doendo
2026-07-06 23:33:34
2
kadu140a
Max Verstappen :
Essa é embaçada
2026-07-05 00:32:00
8
xslauraax
simioni :
nem lançou e já tá doendo
2026-07-06 03:13:51
7
geoodias3
Geovanna 💋 :
2026-07-06 21:34:22
1
steehsilva7
STEH BELEZA E PRESENTES :
a garrafa chega a abrir sozinha
2026-07-06 01:55:26
3
merullykarolainecastro
𝓜𝓮𝓻𝓾𝓵𝓵𝔂 :
Ahhhhhhh meu ocre❤️
2026-07-06 19:30:23
1
_steffanyramalho
Steffany Ramalho :
Gente q música pqpppppppppp
2026-07-07 03:56:04
1
giselemorais545
Gisele Morais545 :
Achei minha música dos últimos tempos 🥺🥺😅
2026-07-06 09:51:45
3
patriciasantos775
Patricia Santos🏳️‍🌈🎱 :
sem condições 😂😂 coração chega fica desesperado 😂
2026-07-05 18:24:11
1
joycefaria.goncal
Joyce Gonçalves :
o ícaro & Gilmar lança essa 😩 é pra acabar
2026-07-07 14:07:08
0
lucasfavoretto7
Lucas Favoretto :
fodaaaaaa 😭
2026-07-05 19:36:34
1
To see more videos from user @jus.souzas, please go to the Tikwm homepage.

Other Videos

So real 🗿👍 cr: @🚩☭_🅉_🇮🇱⃠🇺🇸 ⃠🇺🇦⃠🇪🇺⃠  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. #fyp #foryou #trend #politics #viral
So real 🗿👍 cr: @🚩☭_🅉_🇮🇱⃠🇺🇸 ⃠🇺🇦⃠🇪🇺⃠ 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. #fyp #foryou #trend #politics #viral

About