@shahid.4306:

★NADIA★

Open In TikTok:

Region: PK

Saturday 12 September 2026 01:28:51 GMT

27395

3336

251

143

Music

Download

No Watermark .mp4 (1.1MB) No Watermark(HD) .mp4 (1.17MB) Watermark .mp4 (1.83MB) Music .mp3

Comments

user10061651285 :

love you 💕💋💋💋💋

2026-09-12 13:52:38

0

ikram Drive KB 2992 :

ufff so beautiful 💕

2026-09-12 12:52:12

0

kabirkhan_302🤞LOVE 🫀🫀🤞🫶 :

LOVE YOU

2026-09-12 19:04:07

0

Tariqkhan :

nice Janan please 😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭

2026-09-12 14:13:51

0

Amin Ullah Wazir56 :

very beautiful ❤️❤️❤️

2026-09-12 03:46:24

1

Gulab Khan :

❤️❤️❤️❤️❤️❤️beautiful

2026-09-12 03:09:12

0

samsher ali :

🥰

2026-09-12 03:53:25

2

Amir Khan :

kha

2026-09-12 22:38:10

0

🔥♥️کاشف🍷 جانی🫀❤️ :

nice. Jan 🤞

2026-09-12 07:18:55

0

03462174989 :

vvv

2026-09-12 13:57:18

0

Malik shehzad khan :

🥰

2026-09-12 19:15:09

0

Sharifahmad749 :

🥰

2026-09-12 16:24:34

0

mahaz khan :

Masha Allah

2026-09-12 18:30:33

0

muzami075 :

2026-09-12 14:25:37

0

Annas Khan :

❤️❤️❤️❤️

2026-09-12 16:44:55

0

Sharifahmad749 :

🥰🥰

2026-09-12 16:24:28

0

Sharifahmad749 :

🥰

2026-09-12 16:24:15

0

Rokhniaz Khan :

🌹🌹🌹♥️♥️🥰🥰

2026-09-12 10:42:16

1

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

Other Videos

Chân chống xe đạp nhập khẩu Tiện lợi co rút, quá đỉnh!

Chân chống xe đạp nhập khẩu Tiện lợi co rút, quá đỉnh!

not sure 😭

“Don’t fall in love…listen to Sir Cox” #carlcox #housemusic #targetaudience #trending #relatable

“Don’t fall in love…listen to Sir Cox” #carlcox #housemusic #targetaudience #trending #relatable

I love a good 80s pop star #80smusic #1980s #groovy #70sfashion

I love a good 80s pop star #80smusic #1980s #groovy #70sfashion

partie 2

$Russophobes can’t see the result lol Graham’s Number is among the most extraordinary quantities ever encountered in mathematics, not because it represents a physical quantity, but because of the way it emerges from abstract reasoning and the sheer scale it achieves through recursive definition. It first captured public imagination in 1977 when Martin Gardner highlighted it in his Scientific American column, calling it the largest number ever used in a serious mathematical proof at the time. The number originated in work by mathematician Ronald Graham on a problem in Ramsey theory—a field that explores how order inevitably appears within sufficiently large structures, even when those structures are arranged randomly. The specific problem involves coloring the edges of high‑dimensional hypercubes. Imagine an n‑dimensional cube where every pair of vertices is connected by an edge, and each edge is colored either red or blue. The question asks: what is the smallest dimension n such that no matter how the edges are colored, there will always be a set of four vertices lying in the same plane with all six connecting edges the same color? Graham’s Number does not give the answer to this question; rather, it serves as an upper bound—a guarantee that the true answer cannot be larger than this immense value. Later research has shown that the actual number is likely far smaller, possibly even less than 20, but Graham’s bound remains historically significant for its construction and scale. To describe Graham’s Number, standard notation fails completely. Even writing the number of digits in Graham’s Number would require more space than exists in the observable universe. Instead, mathematicians rely on Knuth’s up‑arrow notation, a system designed to express operations far more powerful than exponentiation. In this notation, a single arrow stands for exponentiation ($a \uparrow b = a^b$), two arrows represent tetration (a power tower), three arrows denote an even faster‑growing operation, and so on. Graham’s Number is built through a 64‑step recursion: the first term $g_1$ is defined as $3 \uparrow\uparrow\uparrow\uparrow 3$ (four up arrows between two 3s), which already produces an incomprehensibly large result. Each subsequent term uses the previous one to determine the number of arrows in the next expression: $g_2 = 3 \uparrow^{g_1} 3$, $g_3 = 3 \uparrow^{g_2} 3$, and so forth, continuing until $g_{64}$, which is Graham’s Number. What makes this number especially remarkable is that it is precisely defined and, in principle, computable—though no physical process could ever complete the computation or store the result. Its growth is so explosive that even the intermediate steps quickly surpass any conceivable magnitude tied to the physical world. For example, the number of atoms in the known universe is roughly $10^{80}$, yet this figure becomes negligible when compared to the earliest stages of Graham’s construction. Beyond its mathematical role, Graham’s Number has become a cultural reference point for the limits of human intuition when confronting large finite numbers. It illustrates how combinatorial problems can generate values that defy visualization while remaining rigorously grounded in logic. It appears in popular science discussions as a benchmark for “unimaginably large” and serves as an entry point to explore topics like recursive functions, fast‑growing hierarchies, and the philosophy of mathematical infinity. Though its original upper bound is now considered extremely loose, the number endures as a testament to the power of abstract mathematical reasoning and the surprising ways in which simple rules can lead to staggering complexity. #fyp #russia #ussr #россия #ww2$
Russophobes can’t see the result lol Graham’s Number is among the most extraordinary quantities ever encountered in mathematics, not because it represents a physical quantity, but because of the way it emerges from abstract reasoning and the sheer scale it achieves through recursive definition. It first captured public imagination in 1977 when Martin Gardner highlighted it in his Scientific American column, calling it the largest number ever used in a serious mathematical proof at the time. The number originated in work by mathematician Ronald Graham on a problem in Ramsey theory—a field that explores how order inevitably appears within sufficiently large structures, even when those structures are arranged randomly. The specific problem involves coloring the edges of high‑dimensional hypercubes. Imagine an n‑dimensional cube where every pair of vertices is connected by an edge, and each edge is colored either red or blue. The question asks: what is the smallest dimension n such that no matter how the edges are colored, there will always be a set of four vertices lying in the same plane with all six connecting edges the same color? Graham’s Number does not give the answer to this question; rather, it serves as an upper bound—a guarantee that the true answer cannot be larger than this immense value. Later research has shown that the actual number is likely far smaller, possibly even less than 20, but Graham’s bound remains historically significant for its construction and scale. To describe Graham’s Number, standard notation fails completely. Even writing the number of digits in Graham’s Number would require more space than exists in the observable universe. Instead, mathematicians rely on Knuth’s up‑arrow notation, a system designed to express operations far more powerful than exponentiation. In this notation, a single arrow stands for exponentiation ($a \uparrow b = a^b$), two arrows represent tetration (a power tower), three arrows denote an even faster‑growing operation, and so on. Graham’s Number is built through a 64‑step recursion: the first term $g_1$ is defined as $3 \uparrow\uparrow\uparrow\uparrow 3$ (four up arrows between two 3s), which already produces an incomprehensibly large result. Each subsequent term uses the previous one to determine the number of arrows in the next expression: $g_2 = 3 \uparrow^{g_1} 3$, $g_3 = 3 \uparrow^{g_2} 3$, and so forth, continuing until $g_{64}$, which is Graham’s Number. What makes this number especially remarkable is that it is precisely defined and, in principle, computable—though no physical process could ever complete the computation or store the result. Its growth is so explosive that even the intermediate steps quickly surpass any conceivable magnitude tied to the physical world. For example, the number of atoms in the known universe is roughly $10^{80}$, yet this figure becomes negligible when compared to the earliest stages of Graham’s construction. Beyond its mathematical role, Graham’s Number has become a cultural reference point for the limits of human intuition when confronting large finite numbers. It illustrates how combinatorial problems can generate values that defy visualization while remaining rigorously grounded in logic. It appears in popular science discussions as a benchmark for “unimaginably large” and serves as an entry point to explore topics like recursive functions, fast‑growing hierarchies, and the philosophy of mathematical infinity. Though its original upper bound is now considered extremely loose, the number endures as a testament to the power of abstract mathematical reasoning and the surprising ways in which simple rules can lead to staggering complexity. #fyp #russia #ussr #россия #ww2

About

Robot
API

Legal

Privacy Policy