@valentinius555: Одесса

ВАЛИК

Open In TikTok:

Region: UA

Friday 31 July 2026 08:27:50 GMT

5193

500

38

81

Music

Download

No Watermark .mp4 (8.52MB) No Watermark(HD) .mp4 (8.52MB) Watermark .mp4 (20.27MB) Music .mp3

Comments

Кузинатра :

Наш любимый город,спасибо за прекрасный ролик,отличная работа,честные душевные слова,и светлые теплые ...

2026-07-31 11:29:35

12

❤️Красавчик❤️ :

Не песня а шедевр 👍 Одеса самый красивый город на земле ❤️❤️❤️💪🙏

2026-07-31 10:11:59

9

Игорь Бедеркин :

😢

2026-07-31 13:39:53

1

user6633379317356 :

2026-07-31 16:25:07

1

Valerievna_ya__ :

Кадры прошлого, наполненные теплом и добрыми воспоминаниями ⚓️🌞✨🕊️

2026-07-31 10:23:28

8

Viktorya :

Спасибо за душевное видео 🥰❤️Цените и дорожите сейчас то что у вас есть 🫶🫶🫶

2026-07-31 08:40:24

7

Tatiana :

таки шикарно прожили, от того и грустно нынче...Песня - хорошА👍🤗

2026-07-31 22:02:10

1

Larysa Gorodishenina :

2026-07-31 15:52:27

1

ХАИМ ПУРИЦ ❤️⚓💛ШАЛОМ-БОНЖУР :

ВАЛИК, БРАТ, КАК ЭТА ЖИЗНЬ ПРОЛЕТЕЛА... ВЧЕРА ЗА МОЛДАВАНКУ СТОЯЛ ПЕРЕД ПЕРЕСЫПЬЮ, ПОСЕЛКОМ, КИЕВСКИММ... И ТУТ ВАМ ЗДРАСТЕ - СЕГОДНЯ ЗА ВСЮ ОДЕССУ СТОЮ...🙏

2026-07-31 20:08:42

2

Aina Kapustina :

2026-07-31 16:15:19

1

да ну нах :

2026-07-31 21:44:25

1

Sergej Tichina :

Ты меня понимаешь Мама!

2026-07-31 19:44:39

1

Олег Грицина :

только что можем вспомнить

2026-07-31 21:18:00

2

Светлана Ромашка :

супер

2026-07-31 20:31:29

1

Sergej Tichina :

Любимый город, мы устали, но держимся!!!

2026-07-31 19:42:12

2

Одессит :

ЛЮБИМАЯ ОДЕССА!

2026-07-31 11:55:18

2

IRINA :

👍👍👍

2026-07-31 09:15:17

1

alexodessa2024 :

❤️❤️❤️

2026-07-31 11:30:24

1

Ляля и Миша :

❤️❤️❤️

2026-07-31 22:31:46

0

vovi400 :

👍👍👍

2026-07-31 21:22:18

1

Валентина Чоповская :

❤️❤️❤️

2026-07-31 15:36:38

1

Леонид :

🔥🔥🔥🔥💪💪🔥💪🔥💪🥰🥰🥰🥰🥰

2026-07-31 11:03:38

1

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

Other Videos

Looking for a stay in Makati? RedDoorz @ San Antonio Makati gotchu. Near coffee shops, food spots, and the quieter side of the city. Comfy rooms and budget-friendly rates for your next Makati adventure! 💯 Use promo code TARAREDKADA for extra discounts on your booking. #Makati #BudgetHotelMakati #RedDoorzPH #Redkada @RedDoorz Philippines #MakatiStaycation

Looking for a stay in Makati? RedDoorz @ San Antonio Makati gotchu. Near coffee shops, food spots, and the quieter side of the city. Comfy rooms and budget-friendly rates for your next Makati adventure! 💯 Use promo code TARAREDKADA for extra discounts on your booking. #Makati #BudgetHotelMakati #RedDoorzPH #Redkada @RedDoorz Philippines #MakatiStaycation

zenithdlc.org promo karanov #спукитайм #фантайм #майнкрафтчиты #читмайнкрафт #spookytime #funtime #expensiveclient #deluxeclient #wexsideclient #zenithdlc

zenithdlc.org promo karanov #спукитайм #фантайм #майнкрафтчиты #читмайнкрафт #spookytime #funtime #expensiveclient #deluxeclient #wexsideclient #zenithdlc

$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 introduced as effective bounds in mathematics, such as Skewes's bound, which in turn is much larger than a googolplex. Graham's number is so large that the observable universe is far too small to contain its ordinary digital representation, assuming that each digit occupies one Planck volume. 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.[1] Using Knuth's up-arrow notation, Graham's number is g 64 {\displaystyle g_{64}},[2] 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, All fake.#viral#fyp#fypシ゚viral#dokidokiliteratureclub#aura$
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 introduced as effective bounds in mathematics, such as Skewes's bound, which in turn is much larger than a googolplex. Graham's number is so large that the observable universe is far too small to contain its ordinary digital representation, assuming that each digit occupies one Planck volume. 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.[1] Using Knuth's up-arrow notation, Graham's number is g 64 {\displaystyle g_{64}},[2] 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, All fake.#viral#fyp#fypシ゚viral#dokidokiliteratureclub#aura

Crazy dogs🤪#animal #pet #funny #funnyvideos #usa_tiktok #fyp #dog #dogsoftiktok #doglover #cutedog #funnymoments #foryourpage

Crazy dogs🤪#animal #pet #funny #funnyvideos #usa_tiktok #fyp #dog #dogsoftiktok #doglover #cutedog #funnymoments #foryourpage

@Kiki #07 #youngho #viral #lipsync

@Kiki #07 #youngho #viral #lipsync

nggih nopo nggihhh?? #fyp #kphgank #kphjogjastyle🚀 #supramamah #foryou

nggih nopo nggihhh?? #fyp #kphgank #kphjogjastyle🚀 #supramamah #foryou

About

Robot
API

Legal

Privacy Policy