@redaksi_d_onenews: Pramuka Kota Surabaya mencetak sejarah dengan memecahkan 3 Rekor MURI sekaligus di Stadion Gelora Bung Tomo. Ribuan peserta mengikuti Basuh Kaki Orang Tua, Pengukuhan Pramuka Garuda, dan Demonstrasi Semaphore. Wali Kota Eri Cahyadi juga menegaskan komitmennya melibatkan Pramuka dalam penguatan Kampung Pancasila dan pembinaan generasi muda Surabaya. #PramukaSurabaya #RekorMURI #EriCahyadi #Surabaya #PramukaIndonesia

redaksi.d-onenews

Open In TikTok:

Region: ID

Saturday 20 June 2026 08:33:35 GMT

25017

478

11

74

Music

Download

No Watermark .mp4 (32.02MB) No Watermark(HD) .mp4 (12.2MB) Watermark .mp4 (34.52MB) Music .mp3

Comments

MIKA👾🆙💯 :

2026-06-20 12:38:07

1

utariiiii :

semua taukan bagaimana panas nya kota surabaya,nah saya salah 1 yg berada di tengah lapangan itu

2026-06-20 09:38:59

2

user41163916980 :

tadi 1 tmp dg Kejuaraan Taekwondi Piala Walikota Cup 2026 tp malah gk mampir sm skli

2026-06-20 13:52:58

1

Rama :

sy tadi pengen foto brsama bapak Eri dn bpk Armuji sek uangele rek .tp gpp AQ ws nduwe videone pas bawa bendera..😁

2026-06-20 09:45:50

0

sebatas tanggung jawab :

ak bahagia mburi, moleh2 dadi malika kecap bango

2026-06-20 10:38:03

0

zxy :

pertama,btw aku mau nak kunu nak mburi dwee

2026-06-20 08:38:28

1

acaa :

@Chal👧🏻

2026-06-20 14:20:01

0

Hafiz Ali Hasnain Shah :

♥️♥️

2026-06-20 15:00:02

0

user13102230527 :

👍🏻👍🏻👍🏻👍🏻👍🏻

2026-06-20 10:01:32

0

octhof :

😳

2026-06-20 15:19:11

0

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

Other Videos

Kelvin Taylor will be sad when hearing this from Afia Pokuaa

Kelvin Taylor will be sad when hearing this from Afia Pokuaa

$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. 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. #fyp #трд #україна #максимбледнов #ато ❗ NO HATE ❗ This video is entirely fictional and for humor only. Any resemblance to actual people, events, or places is purely coincidental. It is a parody made for educational and entertainment purposes. We respect all people, cultures, and beliefs ❤️$
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. 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. #fyp #трд #україна #максимбледнов #ато ❗ NO HATE ❗ This video is entirely fictional and for humor only. Any resemblance to actual people, events, or places is purely coincidental. It is a parody made for educational and entertainment purposes. We respect all people, cultures, and beliefs ❤️

#شعب_الصيني_ماله_حل😂😂

#شعب_الصيني_ماله_حل😂😂

#قصه #الشايب #قديمك_نديمك #قصايد_شعر_خواطر #اكسبلورexplore

#قصه #الشايب #قديمك_نديمك #قصايد_شعر_خواطر #اكسبلورexplore

About

Robot
API

Legal

Privacy Policy