@ariesyukran: "Luka Lama" Iwan Fals (1984) Penderitaan, kekecewaan mendalam karena luka lama kambuh kembali. Mungkin kita pernah merasakan luka, janji, kehilangan harapan dan keindahan, penderitaan yang terus berlanjut. Ya, Luka lama terkadang kembali terasa, tapi musik bisa menjadi pengingat bahwa kita tidak sendirian dalam menghadapi kehidupan. Semoga lagu ini menguatkan dan memberikan makna bagi siapa pun yang mendengarnya. Kasih komentar ya tentang apa yang kalian rasakan setelah mendengar lagu ini! #IwanFals #Luka #LukaLama #CoverLagu #lagulegend #lagunostalgia #musikindonesia #LaguKenangan #lagu80an #fyp #lagusedih #lagulawas

A'ans
A'ans
Open In TikTok:
Region: ID
Sunday 16 February 2025 04:37:11 GMT
176623
5055
81
1614

Music

Download

Comments

ompay_abal2
PinangKering :
Izin repost. Terima kasih🙏
2026-07-25 10:43:01
1
batikrkagamis
Batik Rka :
lagunya yg kaya gini apa judulnya ka
2026-07-30 13:03:19
0
sayadimana88
Saya Dimana ⛎ :
1985
2025-04-13 04:06:48
1
iwanbongkar5
toko si petek :
salam oi
2025-03-10 22:00:05
1
aliungtjong
aliungtjong :
hadir Oi
2025-04-07 04:01:51
1
ayahvivin1
Calon kakek :
ya sayyidii yaa rasuulalloh...🙏🙏🙏
2025-04-03 02:24:29
2
farass461
faraz :
assalamualaikum..ijin share boleh🙏🙏🙏
2025-05-14 13:49:13
1
aji.ojo.dumeh
Aji Ojo dumeh :
salam oi
2025-02-27 11:55:10
1
mamelmayudi1
mamelmayudi :
salam oi
2025-02-26 13:00:04
1
ariarmanmusa
ariarmanmusa :
yaa sayyidii yaa rasuulalloh....🙏🙏🙏
2025-02-16 06:11:49
3
user2423516311061
acos :
judul lagunya luka lama yaa?
2025-02-26 11:49:37
2
udelputranirvana
hello panda :
di youtube ga ada suara anak kecil nya
2025-02-26 15:28:22
2
kunliong8
kunliong8 :
merinding dengar nya
2025-03-22 10:53:41
2
andik.asmara
Andik :
mantap👍👍
2025-04-15 13:47:32
1
redi.umbara0
redi umbara :
mantapp
2025-03-15 13:10:34
1
user838543057
mil :
mentuh hati lagunya 👍👍👍
2025-02-20 12:17:59
2
kodho.dargombes
kodho dargombes :
jooozz.....👍👍👍
2025-04-17 01:06:02
1
moh.nadib
Moh Nadib :
jarang terdengar lagi ini padahal sangat menyatu hati sangat dalam...🤔🤔...
2025-03-29 20:49:22
1
awan.setiawan311
Awan Setiawan :
ok
2025-02-27 02:31:19
1
aripontiponti
sriyantoponti :
udh lama ga dengar lagu ni
2025-02-28 00:06:48
1
dik_nyok
dik_nyok :
Kak ada full nya lagunya nya kah ?
2026-04-11 08:14:26
0
ya.hayyu.ya.qoyyum
ya hayyu ya qoyyum :
👍👍👍👍 mantap
2026-04-17 08:41:58
0
keluargaherball01
keluarga herbal tea :
judul lagu yg ada anak kecil nya?
2026-05-15 12:18:08
0
putrakalingga9
Lha ini ulum#93 :
sangat nusuk ke hati
2026-07-27 15:20:24
0
mamiadel32
mamiadel :
👍👍👍
2025-03-16 10:28:18
1
To see more videos from user @ariesyukran, please go to the Tikwm homepage.

Other Videos

The next edition might be by Luiz.  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 abc⋅⋅⋅, 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
The next edition might be by Luiz. 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 abc⋅⋅⋅, 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

About