Joel Youngsang
Region: JM
Thursday 26 June 2025 00:33:35 GMT
15284
1475
45
407
Music
Download
Comments
Ricardo Henry :
that's why it name "close pin" 😂😂😂
2025-06-26 12:59:54
105
timeiscoming29 :
it’s the close for me think a mi alone duh dat 😂😂😂😂man lock all him car
2025-06-27 02:38:17
1
jahazmair :
works every time 😂😂😂😂
2025-06-26 03:02:02
1
Striker! :
Dat is it! 💯
2025-06-27 15:12:18
0
Nappy :
Joel! Joe El!
2025-06-26 13:37:19
1
🦥🥀⚡ :
that's literally the only way to do it !!
2025-06-27 15:46:19
0
ALADDIN🏴 :
🤣🤣
2025-06-26 00:39:12
1
FV PRODUCTIONS😁 :
Bro yuh say chips bag how we reach yah so 👀😂😂
2025-06-26 03:05:01
44
876GRIM :
🔥🔥tecinanologia🔥🔥🔥
2025-06-26 00:44:25
25
MartinDiMartian :
nobody can't buss da gate deh again 🤣🤣
2025-06-26 04:50:40
10
swedish house :
And the list goes on
2025-06-26 00:36:45
4
Christopher♏️🦂 :
But then nuh me this 🤣🤣🤣
2025-06-27 15:35:21
2
Andre_Official11🇯🇲🇺🇸 :
And the one thing the pin was made for was added in the video 😂😂😂😂😂😂😂
2025-06-26 16:41:58
2
JahJah🇯🇲 :
Board clothes pin indestructible and multifunctional
2025-06-26 03:48:58
2
ApexRose :
best believe say that deh gate not cant force open with just hand strength eno lol
2025-07-09 21:28:32
2
KeepIt Kris :
LMAO 😂😂😂😂 JOOOEEEEL 😂😂😂😂
2025-07-01 03:36:31
1
Toni-Shae Campbell 🌹 :
lift up and move yaa 🤣😭😭😭
2025-06-27 16:01:51
1
Seaford Clarke :
universal lock 🔐
2025-06-26 15:14:16
1
Insoul Beats :
Think a joke 🤣😂
2025-06-27 05:31:24
1
🇯🇲💚Empress 🌬Deborah🖤🇦🇬 :
😂😂😂😂😭😭😭
2025-06-27 01:07:59
1
Kar🎀💗💜 :
🤣🤣🤣
2025-06-26 17:21:32
1
Suchman :
The Jamaican way is just better
2025-06-26 17:18:33
1
Samz©️ :
I use the black files clips from the office
2025-06-26 17:08:28
1
🍯🌻💕 PUNTA 💕🌻🍯 :
🤣🤣🤣🤣🤣🤣
2025-06-26 16:43:11
1
😈👿 YOUNG CHIEF🇯🇲😈 :
finally somebody using close pin the right way
2025-07-15 15:15:14
1
Shakti's Hairlo :
No you fi stop 😂😂😂
2025-06-26 11:27:18
1
kayla :
nice car where do u live just leave the keys in there while you're at it😁
2025-06-26 03:56:47
1
raynola :
😂😂😂
2025-06-26 05:28:54
1
Princess :
🤣🤣🤣
2025-06-26 14:51:54
1
FREE VIBE :
😭😂😂😂 facts 💯
2025-06-26 11:59:32
1
Simmo :
The power of clothes pin!!! 😭😭😭
2025-06-26 13:32:01
1
theoracle601 🇻🇨 :
😭😭😭
2025-06-26 13:43:55
1
theoracle601 🇻🇨 :
💯🤣
2025-06-26 13:44:20
1
うちはマダラ :
Real💀
2025-06-26 14:06:00
1
Elvy G. Soltau :
couldnt tell, I always finish my crackers no matter the size.
2025-06-26 22:59:38
0
seelaing :
😭😭😭
2025-06-27 22:01:21
0
Clue's Delight and Ready Up :
🤣🤣🤣🤣🤣🤣🤣😂😂😂🤣🤣🤣🤣
2025-07-08 09:23:40
0
Simone irie :
❤️
2025-07-09 06:11:30
0
To see more videos from user @joelyoungsang, please go to the Tikwm
homepage.
![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. #neosocialist #junkofuruta #antijunkoaction #hERo #junko](/video/cover/7684069601981975829.webp)
