@luchosincomplique: uno que dice que es tigre y creo que es un gatito

lucho soy mundial
lucho soy mundial
Open In TikTok:
Region: CO
Thursday 19 February 2026 10:26:36 GMT
724359
38623
1550
13849

Music

Download

Comments

william.yepes23411
william yepes2341 :
El único tigre en colombia es FALCAO
2026-02-19 17:51:26
4023
carolinachica121
CAROLINA😍 :
NADA ME HARÁ ODIARTE MI PETRO🥰
2026-02-20 12:06:11
1805
rociogbta
Rocio :
ahora van a demandar a Petro jajajajajajaja
2026-02-19 17:54:06
1089
usert6jx7c71pv
user04707386765 :
porque se esconde detrás de unos vidrios blindados
2026-06-01 10:34:48
43
angyealvarez255
Angye Alvarez..🌻💛🥺 :
jajaja Petro el mejor ,te amo
2026-05-31 10:54:36
11
1_tatis
T A T I 🕷️ :
Mi presi bello con la boca llenita de verdad!😂😂
2026-02-20 13:33:26
124
desconocido_177291
™THE•BLAX® :
acá no ay tigres, ay jaguares y trigrillos
2026-06-11 00:28:09
6
marcelafelizola87
marcelafelizola87 :
el único tigre es el de zucaritas jaja 🤣
2026-02-20 10:29:15
100
merakimafe
Meraki🍪🤎🍪 :
2026-02-20 21:46:50
5
nellyvillarreal490
nellyvillarreal490 :
Tal cual señor presidente tienes toda la razón
2026-02-20 23:38:19
14
jhoasanchez78
jhoa :
jajaja mi petrosky es un crack😂😂
2026-02-20 15:16:14
53
maocesp
Mauro Céspedes :
Se tenía que decir: y se dijo…!!
2026-02-19 12:27:29
19
sara123_16
turizo escolta :
Ivan cepeda próximo presidente
2026-02-21 00:08:07
12
jhon_rico155
Jhon Alex Rico :
Palabras sabías de nuestro presidente! 🤣 🤣 🤣 🤣 🤣
2026-02-19 18:38:18
11
nc58854
Nc :
Jajajaja,todo dicho Señor Presidente
2026-02-20 22:02:41
8
jhon.amador.buitr
Jhon Amador Buitrago :
sí sí 😅😅
2026-02-19 20:45:30
7
yoladlhzc
Yola :
🤣🤣🤣🤣😂😂 amo mi petro 🥰🤣🤣
2026-02-21 03:55:28
6
javibueno61
Javi Bueno :
Muy bien dicho. Ejeejej
2026-02-19 14:19:59
9
user2584607268573
apolo :
más claro imposible
2026-02-19 20:01:36
12
william.alberto.m273
William Alberto Mayorga Ardila :
el muñeco de vitrinaq
2026-02-19 23:58:23
13
jhonneithmelendez3
Jhon Neith. :
Petro la saco del estadio con eso jajajajaja
2026-02-20 17:04:05
33
syrdans23
Danni Rivera :
Les toca hacer show a la derecha porque de propuestas ni una
2026-02-19 17:42:56
54
gatos2533
gatos :
un tigre con las algas mojadas
2026-02-19 17:43:19
188
fandresmjry
REY 👑 ANDRÉS :
un tigre con mucho miedo 🤣😂😂😂
2026-02-20 01:38:25
18
enfdiegoordonez
Diego Ordoñez :
un tigre detrás de la jaula 😅
2026-02-20 00:53:02
14
To see more videos from user @luchosincomplique, please go to the Tikwm homepage.

Other Videos

Dance🫡 #iqmaxx  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. #larp #333 #sinister #dwbi
Dance🫡 #iqmaxx 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. #larp #333 #sinister #dwbi

About