@amirthevet: The way I be catching a vibe a kiler could be behind me and I wouldn’t notice …

Amir Anwary
Amir Anwary
Open In TikTok:
Region: ZA
Monday 06 July 2026 19:05:18 GMT
322899
36819
384
6082

Music

Download

Comments

malspadayachee
Mal :
beautyy and brainsss
2026-07-10 08:28:52
1
sonyavannedwards
Sonya Vann Edwards :
I watched this too many times! 😂😂😂
2026-07-06 19:40:14
298
marybiaggini
Mary Biaggini :
Did I watch this an unhealthy amount of times….yes I did!!
2026-07-07 04:27:40
126
sage_nik
Sage :
Stop being this cute 🥰❤️
2026-07-10 14:42:24
0
bc_reelestate
BC_ReelEstate :
This guy is soooo hott
2026-07-07 01:51:16
71
cynthia.beckham6
Cynthia Beckham❌ :
I want to work for you
2026-07-07 23:13:55
13
stephaniekochisvi
Stephanie Kochis-Villalobos :
My cats need a vet
2026-07-06 22:48:29
16
brooklyngal4lyfe
Sasza :
Lmbooo
2026-07-09 14:34:49
0
layla.luvv
laylaluvv :
whooohooo
2026-07-09 06:21:43
0
savdatatas69gmail.com
Justanurse :
Ayyeeeee
2026-07-09 05:48:52
0
cook_330
Cook_330 Sherri Roth :
Ahhhhhh
2026-07-09 12:27:57
0
gerlenegounden
𝓖𝓮𝓻𝓵𝓮𝓷𝓮 𝓖 🇿🇦 :
2026-07-06 20:12:11
12
samanda.87
mandy :
Amir got moves lol..I just continue vibing tho 😂
2026-07-09 21:20:17
1
heatherbecker33
HeadyLynn :
lol,you're hilarious 😂😂
2026-07-06 20:25:38
19
marycolom13
MaryColom :
You’re f’n hilarious!❤️
2026-07-06 19:50:44
6
dl_montana
Dorothy Bezanson🇨🇦 :
Those dancing lessons are paying off !
2026-07-06 23:15:53
14
phoenixkitsune1402
Kitsune'1402 :
I absolutely love your videos! They’re so entertaining and adorable🥰
2026-07-07 10:30:39
5
luthfia214
Luthfia :
😂 you are literally the cutest
2026-07-07 08:37:10
4
lizellesmith41
lizelle Smith-Zeelie :
😂😂😂No words
2026-07-07 07:33:15
4
mickiev4k
Mickie Vergara G7 :
You got moves !!
2026-07-07 11:43:26
4
luvsmito
athensluvsmito :
2026-07-06 19:10:38
4
To see more videos from user @amirthevet, please go to the Tikwm homepage.

Other Videos

Editing my favorite actor from zeroday2003#zeroday2003 #zeroday #elephant #elephant2003 #actor Graham’s number is one of the largest numbers ever used in a serious mathematical proof. It was introduced by mathematician Ronald Graham in 1971 as an upper bound for a specific problem in Ramsey theory (a branch of combinatorics dealing with conditions under which order must appear in large enough structures). Why is it famous? •  It is insanely large — so large that it dwarfs other famous huge numbers like a googol (10¹⁰⁰), a googolplex (10^googol), or even numbers defined with tetration or multiple up-arrows. •  The number is so big that the observable universe doesn’t have enough particles to write down its digits in ordinary decimal notation, even if each digit took up the space of a Planck volume. •  It is often cited as an example of how recursion and specialized notation allow mathematicians to define quantities far beyond everyday (or even astronomical) scales. How is Graham’s number defined? It uses Knuth’s up-arrow notation, which generalizes exponentiation: •  a ↑ b = a^b (exponentiation) •  a ↑↑ b = a^(a^(…^a)) with b a’s (tetration) •  a ↑↑↑ b = a ↑↑ (a ↑↑ (… ↑↑ a)) with b a’s (pentation), and so on. Graham’s number is constructed in stages, often denoted as g₁, g₂, …, g₆₄, where: •  g₁ = 3 ↑↑↑↑ 3
(3 tetrated to itself many many times — already incomprehensible) •  g₂ = 3 ↑^{g₁} 3
(3 up-arrowed to itself g₁ times) •  g₃ = 3 ↑^{g₂} 3 •  And so on, up to g₆₄. The final Graham’s number is g₆₄. This is a tower of up-arrows whose height and complexity grow at each step in an utterly mind-bending way. Even g₁ is already far larger than anything representable in standard notation. A more intuitive (but still wrong) sense People sometimes say things like: •  The number of digits in Graham’s number has more digits than there are particles in the universe. •  Even the number of levels in its recursive definition makes previous huge numbers look tiny. But any “intuitive” description fails quickly because human language and intuition break down long before you reach even g₂ or g₃. Lower bounds and improvements Graham’s number was an upper bound for the solution to a hypercube-edge-coloring problem in Ramsey theory. Later mathematicians found much smaller upper bounds, and the actual smallest number that satisfies the condition (the Ramsey number) is believed to be vastly smaller than g₆₄ — though still enormous. The current best known upper bound is something like 2↑↑↑6 or smaller in some formulations, but Graham’s original number remains the iconic giant. Fun facts •  It appeared in Martin Gardner’s Scientific American column in 1977, helping popularize it. •  It holds a place in the Guinness Book of World Records (at one point) for “largest number used in a mathematical proof.” •  In popular culture it often shows up in discussions of “big numbers” alongside TREE(3), Loader’s number, or Busy Beaver numbers.
Editing my favorite actor from zeroday2003#zeroday2003 #zeroday #elephant #elephant2003 #actor Graham’s number is one of the largest numbers ever used in a serious mathematical proof. It was introduced by mathematician Ronald Graham in 1971 as an upper bound for a specific problem in Ramsey theory (a branch of combinatorics dealing with conditions under which order must appear in large enough structures). Why is it famous? • It is insanely large — so large that it dwarfs other famous huge numbers like a googol (10¹⁰⁰), a googolplex (10^googol), or even numbers defined with tetration or multiple up-arrows. • The number is so big that the observable universe doesn’t have enough particles to write down its digits in ordinary decimal notation, even if each digit took up the space of a Planck volume. • It is often cited as an example of how recursion and specialized notation allow mathematicians to define quantities far beyond everyday (or even astronomical) scales. How is Graham’s number defined? It uses Knuth’s up-arrow notation, which generalizes exponentiation: • a ↑ b = a^b (exponentiation) • a ↑↑ b = a^(a^(…^a)) with b a’s (tetration) • a ↑↑↑ b = a ↑↑ (a ↑↑ (… ↑↑ a)) with b a’s (pentation), and so on. Graham’s number is constructed in stages, often denoted as g₁, g₂, …, g₆₄, where: • g₁ = 3 ↑↑↑↑ 3
(3 tetrated to itself many many times — already incomprehensible) • g₂ = 3 ↑^{g₁} 3
(3 up-arrowed to itself g₁ times) • g₃ = 3 ↑^{g₂} 3 • And so on, up to g₆₄. The final Graham’s number is g₆₄. This is a tower of up-arrows whose height and complexity grow at each step in an utterly mind-bending way. Even g₁ is already far larger than anything representable in standard notation. A more intuitive (but still wrong) sense People sometimes say things like: • The number of digits in Graham’s number has more digits than there are particles in the universe. • Even the number of levels in its recursive definition makes previous huge numbers look tiny. But any “intuitive” description fails quickly because human language and intuition break down long before you reach even g₂ or g₃. Lower bounds and improvements Graham’s number was an upper bound for the solution to a hypercube-edge-coloring problem in Ramsey theory. Later mathematicians found much smaller upper bounds, and the actual smallest number that satisfies the condition (the Ramsey number) is believed to be vastly smaller than g₆₄ — though still enormous. The current best known upper bound is something like 2↑↑↑6 or smaller in some formulations, but Graham’s original number remains the iconic giant. Fun facts • It appeared in Martin Gardner’s Scientific American column in 1977, helping popularize it. • It holds a place in the Guinness Book of World Records (at one point) for “largest number used in a mathematical proof.” • In popular culture it often shows up in discussions of “big numbers” alongside TREE(3), Loader’s number, or Busy Beaver numbers.

About