@iwiwirka: Играю в BLACK RUSSIA на сервере GRAY! Мой ник: Noah_Narcos Мой промо: #Narcos #blackRussia #блекраша #matreshkarp #br

Black Russia Narcos

Open In TikTok:

Region: BY

Thursday 14 May 2026 17:13:06 GMT

22979

1402

54

373

Music

Download

No Watermark .mp4 (0.72MB) No Watermark(HD) .mp4 (0.72MB) Watermark .mp4 (1.75MB) Music .mp3

Comments

🧊DEB4IK🧊 :

Это емелю пробежал

2026-05-14 18:21:30

33

15_Р :

Хахахахах я помню как я специально на автобусе работал чтоб по общяться

2026-05-15 11:12:19

15

Блек Раша :

жиза жиза

2026-05-17 21:02:40

0

Государь :

Такого небыло

2026-06-16 14:31:48

0

Zippo47476 :

я помню без перерывов водил автобус и 300к поднял

2026-06-07 20:19:03

0

Gromov/AQUA 🩵 :

долго скачивал??

2026-05-16 14:21:45

1

ПАЗ Vector NEXT | 517 72 :

ХАААХХААХХАХАХ

2026-06-12 13:24:37

0

Милан :

факты

2026-05-14 18:11:08

0

@motaboks52 :

о я тоже с грея

2026-06-15 05:11:04

0

Хрiша :

долго скачивал?

2026-06-06 11:59:11

0

Апостол :

Я на МО пошел как апреля 2 уровень

2026-05-15 15:48:37

1

Ryan Cooper :

Видос Fazer

2026-05-22 13:17:46

0

Vladosik :

ну да вопще каждый день работаю не 1 игрока в автобусе

2026-06-04 12:09:02

0

Furror_Personal :

разве в 2026 ктото только начинает играть в бр?

2026-05-17 20:56:15

0

RAGE RUSSIA :

бригаду что тогда было

2026-05-17 20:46:20

1

. :

Там я за 0 рублей делал а по метка там не мало платят

2026-05-25 14:37:16

0

+374 🇦🇲🇪🇺 :

Я тож на сервере GRAY

2026-05-14 20:10:38

2

monetka :

ахаххаха братик как ты так сделал

2026-05-17 20:43:02

0

|𝓡𝓮𝓷𝓪𝓽 | :

хаха

2026-06-17 12:42:26

0

Alisher :

🤣🤣🤣🤣🤣🤣 ема имба вышло

2026-06-14 04:11:30

0

Melody_Layk :

автор "не крал я видео"

2026-06-16 11:43:11

0

VLAD.🄱r :

пора фазеру водянку ставить...

2026-05-24 17:35:21

0

|𝓡𝓮𝓷𝓪𝓽 | :

всм щас 200р хули они ещё и жалуются

2026-06-17 12:42:45

0

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

Other Videos

$beavers, the actor. |Graham's number is an immense 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 such as Skewes's number and Moser's number, both of which are in turn much, much larger than a googolplex. As with these, it is so large that the observable universe is far too small to contain an ordinary digital representation of Graham's number, assuming that each digit occupies one Planck volume, possibly the smallest measurable space. 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. Using Knuth's up-arrow notation, Graham's number is g 64 {\displaystyle g_{64}},[1] 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.#truecringecomunity #fakesituation⚠️ #fyp #allfake #beavers$
beavers, the actor. |Graham's number is an immense 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 such as Skewes's number and Moser's number, both of which are in turn much, much larger than a googolplex. As with these, it is so large that the observable universe is far too small to contain an ordinary digital representation of Graham's number, assuming that each digit occupies one Planck volume, possibly the smallest measurable space. 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. Using Knuth's up-arrow notation, Graham's number is g 64 {\displaystyle g_{64}},[1] 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.#truecringecomunity #fakesituation⚠️ #fyp #allfake #beavers

#chaussures #chaussures #mode #hommestyle #dames

#chaussures #chaussures #mode #hommestyle #dames

شيلة تخرج باسم غلا2026شيلة تخرج غلا#شيلات_زوجات_عامه #شيلات_تخرج_غلا #شيلة_تخرج_غلا #استديو_شيخة_الجمال #السعودية_الكويت_قطر_الإمرات_سلطنة_عمان

شيلة تخرج باسم غلا2026شيلة تخرج غلا#شيلات_زوجات_عامه #شيلات_تخرج_غلا #شيلة_تخرج_غلا #استديو_شيخة_الجمال #السعودية_الكويت_قطر_الإمرات_سلطنة_عمان

#tecnoindonesia #tecnopromotor #tecnokalimantan #tecnomegapadse

#tecnoindonesia #tecnopromotor #tecnokalimantan #tecnomegapadse

#الرادود #سجاد_المحمداوي #ابو_بشير_النجفي #ياليل #شور مشترك قصيدة سمع الله لمن نادا ياحسين

#الرادود #سجاد_المحمداوي #ابو_بشير_النجفي #ياليل #شور مشترك قصيدة سمع الله لمن نادا ياحسين

About

Robot
API

Legal

Privacy Policy