@hhhgjamhllrp: Working in low light? These LED safety glasses combine hands-free lighting with wraparound eye coverage, so you can see what you’re doing without juggling a flashlight. #TikTokMadeMeBuyIt #SafetyGlasses #LEDGlasses #DIYProjects #TikTokShop

hhhgjamhllrp
hhhgjamhllrp
Open In TikTok:
Region: US
Monday 05 October 2026 15:36:12 GMT
2582124
9448
180
3466

Music

Download

Comments

zunigasystementertainmen
Zuniga System Entertainment :
I use glasses 👓 so my nebo headlamp works just fine
2026-10-06 12:25:16
15
orangepump6
orangepump :
Do you think anybody would notice if I wore them at a restaurant looking at a menu…?
2026-10-07 16:24:49
154
lifeafterbumble
🤷🏻‍♂️ :
Awesome product ! but that light is so bright I’m going to end up finding problems I’m just not ready to see 😅
2026-10-10 15:26:30
10
technology0223
technology :
Dad's are amazing.
2026-10-10 21:09:43
0
chickennuggetpeoples
ChickenNuggetPerson :
Needs an option with magnifying lenses for people with vision issues
2026-10-10 19:57:22
0
astrooo13_
ASTROOO :
Do they come in z87
2026-10-10 19:47:23
0
neeknailedit
Wichita KS nail tech :
As a nail tech, need.
2026-10-10 19:08:13
0
mr..ramjangles
Mr. Ramjangles :
As someone who used to hold the flashlight for dad in the 80s & early 90s, I’ll take 27 of these. 😂😂😂
2026-10-10 17:39:05
0
neighbor.karen
NEIGHBOR.KAREN :
do they have AI?
2026-10-10 18:00:08
0
kyles2956
kyles2956 :
*future squidward meme
2026-10-06 14:28:40
0
dontputmeonspeaker
Si Lopez :
Nah. I prefer to be yelled at to hold the flashlight right. 😂
2026-10-08 01:41:38
23
elitebbqsmokers
Elite BBQ Smokers :
Can I get these in a +1.5 reader
2026-10-07 13:01:37
10
kharris615
tatted78 :
How’s the light shining so bright before you even turn it on??? 😂
2026-10-06 22:20:00
16
didishavemyballsforthis
Tim :
Who does he yell at when the flash light isn’t just right?
2026-10-08 10:07:48
15
robertheck17
Robert Heck :
I need this with 2.5 magnifiers lenses
2026-10-08 20:01:26
5
atheistreagan
AtheistReagan 🇺🇸 🥓 :
If it get this I’m returning all the gifts I bought
2026-10-10 15:01:38
0
maxcfm1
MAXCFM :
hell yeah! ill try this!
2026-10-09 01:19:17
0
richy121272
richy121272 :
It was already bright before he put the glasses on!!!
2026-10-08 16:34:25
1
cruizerstylin2
Cruizer Stylin :
Will they fit over dad’s reading glasses?
2026-10-06 15:09:53
11
oxyka
￴ ￴￴ ￴ ￴ ￴ ￴ ￴￴ ￴ ￴ ￴ ￴ ￴ :
2026-10-08 13:18:43
0
vrncryptic
Eddy :
So I can’t put my prescription in 😔
2026-10-09 06:35:55
0
bougie_n_broke
Bougie-N-Broke :
they look heavy
2026-10-09 06:25:52
0
sechino2
SEchino :
2026-10-07 23:42:09
0
danielb6380
danielb63 :
What’s the lens for?
2026-10-09 22:34:45
0
weebs_bizarre_adventure
Angel Escareño :
I think it needs like 5 more extra ligths but I do like it 👍
2026-10-09 02:31:34
1
To see more videos from user @hhhgjamhllrp, please go to the Tikwm homepage.

Other Videos

We all love LGBTQ community🪓 Graham's number (G) is an unimaginably vast integer that arose as an upper bound in Ramsey theory, a branch of mathematics dealing with patterns within complex structures. For a long time, it held the Guinness World Record for the largest explicit positive integer ever used in a serious mathematical proof. The Mathematical Problem In 1971, mathematician Ronald Graham studied hypercubes (cubes in n dimensions). The problem asks: > Connect every pair of vertices in an n-dimensional hypercube to draw a complete graph. Then, color every edge either red or blue. What is the smallest dimension n that guarantees you will find a single-color, 4-vertex coplanar sub-graph, no matter how you color the edges? >  Graham proved that such a dimension exists and established an upper bound to guarantee it. That upper bound is Graham's number. Why Standard Notation Fails Graham's number is so large that the observable universe is too small to contain a simple decimal representation. Even if every Planck volume in the universe were filled with a single digit, you would run out of space almost instantly. To write it, mathematicians use Knuth's up-arrow notation (\uparrow), which extends arithmetic operations beyond exponentiation:  * Single Arrow (Exponentiation): 3 \uparrow 3 = 3^3 = 27  * Double Arrow (Tetration / Power Towers): 3 \uparrow\uparrow 3 = 3^{3^3} = 3^{27} = 7,625,597,484,987  * Triple Arrow (Pentation): 3 \uparrow\uparrow\uparrow 3 = 3 \uparrow\uparrow (3 \uparrow\uparrow 3) = 3 \uparrow\uparrow 7,625,597,484,987 (a tower of 3s that is over 7.6 trillion terms high) A tower of 3s just 4 terms high (3^{3^{3^3}}) is already greater than 10^{3.6 \times 10^{12}}, vastly outnumbering the total count of atoms in the known universe (\sim 10^{80}). Constructing Graham's Number Graham's number is built using a 64-layer recursive sequence where each layer determines the number of arrows in the next: | Layer | Value | Description | |---|---|---| | g_1 | 3 \uparrow\uparrow\uparrow\uparrow 3 | 4 up-arrows between two 3s (already incomprehensibly large) | | g_2 | 3 \uparrow^{g_1} 3 | The number of arrows between the 3s is equal to g_1 | | g_3 | 3 \uparrow^{g_2} 3 | The number of arrows between the 3s is equal to g_2 | | ... | ... | ... | | g_{64} | G (Graham's Number) | The number of arrows between the 3s is equal to g_{63} | Current Status While Graham's number is finite, its exact value remains unknown beyond its final digits (which end in ...2464195387 shopping/math-sequence). Since Graham's original proof, mathematicians have narrowed the solution bounds significantly: the upper bound has been reduced to much smaller numbers, while the lower bound has been proven to be at least 13. @🇹🇷⚛️TrueTurk⚛️🇹🇷  #fyp #targetaudience #🍵🌊🌊tok #teaseasea #tgd
We all love LGBTQ community🪓 Graham's number (G) is an unimaginably vast integer that arose as an upper bound in Ramsey theory, a branch of mathematics dealing with patterns within complex structures. For a long time, it held the Guinness World Record for the largest explicit positive integer ever used in a serious mathematical proof. The Mathematical Problem In 1971, mathematician Ronald Graham studied hypercubes (cubes in n dimensions). The problem asks: > Connect every pair of vertices in an n-dimensional hypercube to draw a complete graph. Then, color every edge either red or blue. What is the smallest dimension n that guarantees you will find a single-color, 4-vertex coplanar sub-graph, no matter how you color the edges? > Graham proved that such a dimension exists and established an upper bound to guarantee it. That upper bound is Graham's number. Why Standard Notation Fails Graham's number is so large that the observable universe is too small to contain a simple decimal representation. Even if every Planck volume in the universe were filled with a single digit, you would run out of space almost instantly. To write it, mathematicians use Knuth's up-arrow notation (\uparrow), which extends arithmetic operations beyond exponentiation: * Single Arrow (Exponentiation): 3 \uparrow 3 = 3^3 = 27 * Double Arrow (Tetration / Power Towers): 3 \uparrow\uparrow 3 = 3^{3^3} = 3^{27} = 7,625,597,484,987 * Triple Arrow (Pentation): 3 \uparrow\uparrow\uparrow 3 = 3 \uparrow\uparrow (3 \uparrow\uparrow 3) = 3 \uparrow\uparrow 7,625,597,484,987 (a tower of 3s that is over 7.6 trillion terms high) A tower of 3s just 4 terms high (3^{3^{3^3}}) is already greater than 10^{3.6 \times 10^{12}}, vastly outnumbering the total count of atoms in the known universe (\sim 10^{80}). Constructing Graham's Number Graham's number is built using a 64-layer recursive sequence where each layer determines the number of arrows in the next: | Layer | Value | Description | |---|---|---| | g_1 | 3 \uparrow\uparrow\uparrow\uparrow 3 | 4 up-arrows between two 3s (already incomprehensibly large) | | g_2 | 3 \uparrow^{g_1} 3 | The number of arrows between the 3s is equal to g_1 | | g_3 | 3 \uparrow^{g_2} 3 | The number of arrows between the 3s is equal to g_2 | | ... | ... | ... | | g_{64} | G (Graham's Number) | The number of arrows between the 3s is equal to g_{63} | Current Status While Graham's number is finite, its exact value remains unknown beyond its final digits (which end in ...2464195387 shopping/math-sequence). Since Graham's original proof, mathematicians have narrowed the solution bounds significantly: the upper bound has been reduced to much smaller numbers, while the lower bound has been proven to be at least 13. @🇹🇷⚛️TrueTurk⚛️🇹🇷 #fyp #targetaudience #🍵🌊🌊tok #teaseasea #tgd

About