tecca22
Region: CI
Saturday 14 February 2026 22:37:20 GMT
384986
48255
432
963
Music
Download
Comments
Jano 🤪🥳 :
Elle a été franc inh 🤣🤣🤣
2026-02-15 09:04:43
196
Maéva 😊 fille noir :
je suis célibataire 🫣 juste pour ce distraire
2026-02-28 23:23:07
40
✌️~Rikki Tikki Tavi ~💛 :
maintenant vous avez mis en favoris la c'est pour quoi 😂🤣
2026-02-15 14:35:18
41
Bousket de la 3 :
On peut pas télécharger quoi c’est pas quoi Ahh hein 😂😂😂
2026-03-05 20:33:44
6
Ariel Metuschelah :
autant pour vous, autant pour moi 😭
2026-02-23 04:39:54
11
Ousmane🇨🇮🫶🇲🇱👈🏾 :
😂😂😂
2026-03-11 23:42:16
13
🧠🐺 :
Je ne peux pas rire sinon les moustiques vont remarquer que je suis dans la chambre 😂😂😂
2026-02-15 15:50:13
6
BigBaows[?] :
Qui a remarquer ça façons de regarde 😂😂
2026-02-16 14:36:17
10
Enorck Monfils :
C'est faux terre la même qui me retient 😅😅😅
2026-04-30 11:00:14
2
Le silencieux 🤟🤟 :
donner ta vie a Dieu
2026-02-16 21:32:32
3
Cedric Aka :
c'est mon ex
2026-02-15 13:28:55
4
🧿Agnamalai 357 🔱 :
les chaînes 740et 743
2026-02-26 22:22:37
4
Yanno le canadien 🫀🇨🇦 :
quel vérité 😂
2026-04-01 17:48:27
2
Tiktok :
2026-05-14 12:34:33
1
🌟JUNIOR SPAMS 😛 :
Ils dis quand tu est seul à la maison en comment avec mes amis
2026-04-03 19:48:06
2
E…❦ :
Elle est honnête je l’aime bien
2026-02-16 14:34:30
3
Ismail :
cool 🥰🥰
2026-03-06 14:59:56
1
LEGRANDFRANK :
c'est quoi tout sa la
2026-03-16 18:35:56
3
Bloco De Poy :
elle est très belle
2026-04-18 09:37:11
1
Femme c'est problème :
hum hum ça la c'est pas distraction dès c'est ton habitude même 🤣🤣
2026-04-15 18:13:03
1
Général CFA 🏍️💯 :
je serai riche
2026-03-12 10:55:36
1
Hamissou Salabirou 🇧🇯vs🇧🇪 :
😅😅😅😅
2026-03-14 03:59:03
1
tecca22 :
Qui a republier ?
2026-02-14 22:38:00
4
brahimatraore851 :
c’est dohi
2026-03-20 04:01:14
1
libanais :
Qui Qui 🥰
2026-03-01 20:58:43
1
To see more videos from user @tecca022, please go to the Tikwm
homepage.
![I failed my posting streak guys :( Sorry fellas #edit #xyzbca #fcc #fyp #dontflop Graham's number is a very large 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.](/video/cover/7681092782907297055.webp)
