@docvamiss2011: gia đình hạnh phúc🖤#TikTokAwardsVN #xh

𝓒𝓱𝓾𝓷𝓰 𝓬𝓱𝓾𝓷𝓰

Open In TikTok:

Region: VN

Friday 17 October 2025 05:42:44 GMT

301757

19766

260

3137

Music

Download

No Watermark .mp4 (1.03MB) No Watermark(HD) .mp4 (1.03MB) Watermark .mp4 (1.06MB) Music .mp3

Comments

qa. :

t thề với m cả đời t cũng kh có

2026-04-05 05:41:32

579

🐰 :

Đơn giản vậy th mà t cũng ko có nữa…

2026-05-23 13:34:55

33

Ai hỏi :

Nhìn mà chỉ bt ước vì trong đời một lần cx ko đc như v

2026-06-08 20:11:08

3

Michael và Vlad :

T ước thì t cũng ko có được 🥺

2026-06-08 16:03:20

1

người đẹp gái và hai hòn dái :

nhạc gi vay a

2026-06-02 12:56:08

2

iloventh>< :

uoc

2026-05-09 18:14:32

1

👤 :

Nhiều khi t cảm thấy ở 1 mik còn thoải mái hơn ở với ba mẹ

2026-06-06 17:21:43

2

Ngọc Hân cô đơn :(((389 :

em họ của mình kể là, em họ mình ko bao giờ có một cái sinh nhật vui vẻ và hạnh phúc,em họ mình ko được ba mẹ yêu thương em út của em họ mình

2026-06-06 11:26:39

2

anh bảy bảnh 🫪 :

nghèo mà vui vậy được rồi tôi muốn cũng chẳng được

2026-06-05 13:17:14

1

Công chúa🐟🐟 :

đó là thứ mà e ko bao giờ bắt trước đc

2026-04-18 11:36:53

7

Thanh Tràa :

Hạnh phúc kh khó, nhưng toi lại kh có....

2026-05-19 04:19:42

6

Moon Nè 🎀 :

tôi có sinh nhật lớn hơn nhưng 👇🏻

2026-03-02 11:28:48

19

hai tay hai anh~ :

sinh nhật đông đủ của tớ là năm 3t giờ 13t thì không còn cảm giác này sinh nhật chỉ vài người đến mẹ thì có anh em cũng có nhưng ba thì không ba mẹ tớ ly hôn lúc tớ 4t nên khi sinh nhật tớ cứ mong có ba đến...

2026-03-26 03:29:38

6

ᰔᩚ :

Cảnh này mãi mãi t k thể có …😔

2026-03-22 05:03:55

9

gái lạnh lùngg😈😘 :

nhìn gdinh ngta hphuc mà nhìn lại gdinh mình...🖤😑

2026-04-10 14:38:31

24

nờ >< :

1 cái hộp cungg ko có -)

2026-02-03 12:16:51

6

Lốp bền vững🛞 :

s gđ mình đầy đủ mà lạ v ta?

2026-01-28 15:10:47

10

VY🫪🫪🫪 :

tôi nỗi một cái bánh kem cũng ko có 😔😔😔

2026-06-05 14:10:25

3

phôn lường𐙚 :

dethuon quó🥰😝

2026-05-14 14:45:30

2

bin :

dream

2026-05-19 11:30:35

1

Skibidi💤 :

Chỉ là 1 việc lm đơn giản th mà có nghìn ng áo ước cx chẳng thể nào có đc

2026-06-08 14:57:27

1

sao băng nhỏ đáng iu~ :

thứ mình có 5 năm trước

2026-05-27 12:20:34

1

hn :

ước nhĩ

2026-06-03 10:31:13

1

Tyy iuu🧸 :

vui ha ☺️

2026-04-04 16:58:33

1

To see more videos from user @docvamiss2011, please go to the Tikwm homepage.

Other Videos

dumta ummi #fyp#viral#nasheed#islamic#امي @let_me_cook

dumta ummi #fyp#viral#nasheed#islamic#امي @let_me_cook

$Editing my favorite actor from zeroday2003#zeroday #zeroday2003 #elephant #ai #actor Graham’s number (often written as G) is one of the most famous extremely large finite numbers in mathematics. It was introduced by mathematician Ronald Graham in 1971 as an upper bound for a problem in Ramsey theory (a branch of combinatorics dealing with conditions under which order must appear). The Problem It Solves (Simplified) Imagine coloring the edges of a high-dimensional hypercube with two colors (say, red and blue). Graham’s number provides a (vastly oversized) upper bound on the number of dimensions needed to guarantee that you’ll find a certain monochromatic planar structure—no matter how you color it. The actual solution is known to be much smaller (between 11 and 13 in some improved bounds), but Graham’s number was a constructive upper bound at the time. How It’s Defined: Knuth’s Up-Arrow Notation Graham’s number is so large that ordinary mathematical notation (exponents, factorials, etc.) fails completely. It uses Knuth’s up-arrow notation, which extends exponentiation: • 3 ↑ 3 = 3³ = 27 (exponentiation) • 3 ↑↑ 3 = 3 ↑ (3 ↑ 3) = 3²⁷ = 7,625,597,484,987 (tetration: a power tower of three 3’s) • 3 ↑↑↑ 3 = 3 ↑↑ (3 ↑↑ 3) → an insanely tall power tower • 3 ↑↑↑↑ 3 = 3 ↑↑↑ (3 ↑↑↑ 3) → tetration iterated an incomprehensible number of times And so on. More arrows mean vastly faster growth. Graham’s number is built recursively in 64 steps (often denoted as g₆₄): • g₁ = 3 ↑↑↑↑ 3 (four up-arrows between 3s) • g₂ = 3 (with g₁ up-arrows) 3 • g₃ = 3 (with g₂ up-arrows) 3 • … • Graham’s number G = g₆₄ Each gₙ defines the number of arrows used in the next level. By g₂ you’re already dealing with a number of arrows equal to g₁ (which itself dwarfs anything in the observable universe), and it keeps exploding from there for 64 layers. Why It’s Mind-Blowing • Even the number of digits in Graham’s number is incomprehensible. • The observable universe doesn’t have enough particles to write out even a tiny fraction of its digits (or even the number of digits of its digits, and so on). • It was once listed in the Guinness Book of World Records as the largest number ever used in a mathematical proof. • Yet it’s still a finite number—far smaller than many numbers later defined in googology (the study of large numbers).$
Editing my favorite actor from zeroday2003#zeroday #zeroday2003 #elephant #ai #actor Graham’s number (often written as G) is one of the most famous extremely large finite numbers in mathematics. It was introduced by mathematician Ronald Graham in 1971 as an upper bound for a problem in Ramsey theory (a branch of combinatorics dealing with conditions under which order must appear). The Problem It Solves (Simplified) Imagine coloring the edges of a high-dimensional hypercube with two colors (say, red and blue). Graham’s number provides a (vastly oversized) upper bound on the number of dimensions needed to guarantee that you’ll find a certain monochromatic planar structure—no matter how you color it. The actual solution is known to be much smaller (between 11 and 13 in some improved bounds), but Graham’s number was a constructive upper bound at the time. How It’s Defined: Knuth’s Up-Arrow Notation Graham’s number is so large that ordinary mathematical notation (exponents, factorials, etc.) fails completely. It uses Knuth’s up-arrow notation, which extends exponentiation: • 3 ↑ 3 = 3³ = 27 (exponentiation) • 3 ↑↑ 3 = 3 ↑ (3 ↑ 3) = 3²⁷ = 7,625,597,484,987 (tetration: a power tower of three 3’s) • 3 ↑↑↑ 3 = 3 ↑↑ (3 ↑↑ 3) → an insanely tall power tower • 3 ↑↑↑↑ 3 = 3 ↑↑↑ (3 ↑↑↑ 3) → tetration iterated an incomprehensible number of times And so on. More arrows mean vastly faster growth. Graham’s number is built recursively in 64 steps (often denoted as g₆₄): • g₁ = 3 ↑↑↑↑ 3 (four up-arrows between 3s) • g₂ = 3 (with g₁ up-arrows) 3 • g₃ = 3 (with g₂ up-arrows) 3 • … • Graham’s number G = g₆₄ Each gₙ defines the number of arrows used in the next level. By g₂ you’re already dealing with a number of arrows equal to g₁ (which itself dwarfs anything in the observable universe), and it keeps exploding from there for 64 layers. Why It’s Mind-Blowing • Even the number of digits in Graham’s number is incomprehensible. • The observable universe doesn’t have enough particles to write out even a tiny fraction of its digits (or even the number of digits of its digits, and so on). • It was once listed in the Guinness Book of World Records as the largest number ever used in a mathematical proof. • Yet it’s still a finite number—far smaller than many numbers later defined in googology (the study of large numbers).

Fail today. #MandelaQuotes #Madiba #LegendMandela #MandelaDay #NelsonMandela

Fail today. #MandelaQuotes #Madiba #LegendMandela #MandelaDay #NelsonMandela

Okay, Let’s go!!! Đẹp mã (ver rap) #GeminiHungHuynh #DepMa #Tiemgaudepmachallenge #fyp #hathocungchang @Gemini Hùng Huỳnh

Okay, Let’s go!!! Đẹp mã (ver rap) #GeminiHungHuynh #DepMa #Tiemgaudepmachallenge #fyp #hathocungchang @Gemini Hùng Huỳnh

#كوميديا_سوداني_ضحك #الشعب_الصيني_ماله_حل😂😂 #السودان

#كوميديا_سوداني_ضحك #الشعب_الصيني_ماله_حل😂😂 #السودان

About

Robot
API

Legal

Privacy Policy