@sandunidlokuge: New Year Lantern Festival in Chiangmai ✨ Chiang Mai New Year Lantern Festival: A Night of Magic & Renewal✨ Picture this: thousands of glowing lanterns rising into the night sky, carrying away troubles and lighting up hopes for the future. That's the magic of Yi Peng in Chiang Mai.🌌💫 More than just a stunning spectacle, this festival is all about letting go of the past and embracing new blessings. It's a spiritual tradition where locals and visitors come together in the most beautiful way. 🕊️✨ #sandunidlokuge #independentwoman #thailand #chiangmai #newyear #lanternfestival2025 #beautifulsky #travel #travalgirl #travelworldwide #explore #Lifestyle #travelphotography #NYE #travelbucketlist #onesinthelifetime #fypシ #fupage #fyppppppppppppppppppppppp #tiktokviral #viraltiktok #viral #viralvideo #onemillionaudition #trending

Sanduni D Lokuge
Sanduni D Lokuge
Open In TikTok:
Region: TH
Wednesday 01 January 2025 05:21:16 GMT
178027
3296
39
3171

Music

Download

Comments

oussowez
Sam :
Bangkok ?
2026-06-20 14:45:57
1
aleja24601
Alejandra :
Hi, which ticket did you pay for having access to this view? was it elite?
2025-05-27 11:08:29
9
abcde.3_
abcdefghi :
Should I buy the tickets here : chiangmaiyipengfestival.com of here : chiangmainewyearcountdown.com which one do you think is better ?
2026-06-29 11:59:42
0
aymxnnn1
aymnnn :
observer place is free?
2025-12-17 02:45:49
0
jorunasleo
Jorunas Leo :
since they have an observer option, would it be possible to get lantern inside and release from observer place?
2025-11-30 16:35:39
5
chelseamargery2
Chelseamargery2 :
So confused with booking this
2025-11-18 22:18:29
1
nathalietaylor2
Nat 🖤 :
How do you buy tickets
2025-10-13 19:52:02
1
capuchalenvers
Matteo Logeat :
Hello ? What category did you take ? Like standard or VIP ?
2025-11-05 10:09:52
0
johnwayne90566
Rule Rule, Britannia! :
What date is this ?
2025-07-16 14:51:25
5
mahcarvalh
Marina Fiat 500 🍒 :
Em qual data que tem as lanternas flutuantes ? É no ano novo ? Data 31 de dezembro ?
2026-04-05 01:01:12
0
xand_x3
𓃰🇵🇭 Xandrei🇵🇭𓃰 :
🥰
2025-12-31 20:13:21
0
linaeljamii0
Lina Eljamii 🌸 :
2026-01-02 11:17:45
0
linaeljamii0
Lina Eljamii 🌸 :
😍
2026-01-02 11:17:44
0
owenryan98
Owen :
🤝
2025-12-06 20:55:27
0
lindazumberovic
lindazumberovic :
🥰🥰🥰
2026-01-02 13:41:52
0
udaya.malsha
Udaya Malsha :
😍😍😍
2025-01-02 12:15:42
3
vivienvari02
Vári Vivien :
😍😍😍
2025-09-30 18:21:46
0
sasangeethkottehewa
❤️ WolfBoss 🇦🇺🦘 :
💖💖
2025-02-14 18:46:08
2
ab_law73
AB :
🤝🤝🤝
2026-06-19 15:50:27
0
lebogang.mutloane
lebogang mutloane :
@BLACKQUEEN
2026-03-13 17:10:29
0
siamseaplane
Siam Seaplane :
Experience the ultimate convenience and luxury with Siam Scenic's private charter flights, available from any destination in Thailand.
2025-12-27 14:02:19
1
jooo3611
Jooo :
Where did you sit ? Elite ? Vip?
2026-01-03 00:27:13
0
To see more videos from user @sandunidlokuge, please go to the Tikwm homepage.

Other Videos

Attemp of wave, didn't like it. . . . 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. #edit #schizowave #fedposting #dogwhistle
Attemp of wave, didn't like it. . . . 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. #edit #schizowave #fedposting #dogwhistle

About