@iyandris: Membalas @rep shopee eror video upload terbaru tidak muncul #shopeeaffiliate #shopeevideo

Iyandri
Iyandri
Open In TikTok:
Region: ID
Sunday 28 June 2026 11:13:31 GMT
14247
212
186
131

Music

Download

Comments

jazilah731_
Ruangtumbuh17 :
ada yg sama nggak sampe skrg masih nggak bisa? punyaku dari lusa🫣
2026-06-29 00:00:47
21
cmukkhway
अच्छा और आज्ञाकारी बच्चा :
Punya kalian udh normal? Dr kmren punya sy pas mau upload stuck terus loading terus di angka 8%
2026-06-30 02:46:20
1
akbar.el.hamed
Sandang || Pangan :
kirain akunku doang kirain ada PL atau gimana
2026-06-28 18:03:39
7
tokocantika92
Tokocantika92 :
Di aku bbrp video baru upload viewnya 0 biar di tonton sendiri ga ngaruh ttp 0😅
2026-06-29 11:32:56
1
luvita.asri
Luvita Asri :
Bg bisa gk, klo 1 vidio di ulang posting hanya beda Seller keranjang oren aja (produk sama) . Termasuk spam gk tu
2026-06-28 23:08:49
1
akuaramu
akuara :
iyaa sama punya ku jgaa gtu bru uplod smlem ga keliatan smpe siang ini
2026-06-29 03:26:23
1
rimamei3
Rima Meilani :
Udah dag dig dug kepikiran seharian,takut gabisa jualan lg😭eh ternyata eror dan banyak temenya😭
2026-06-28 17:26:05
3
spalspilid1
𐙚 s p a l s p i l 𐙚 :
Skrg juga masih eror . Apa harus upload lagi ?
2026-06-29 00:25:10
2
yukjajanteruss
rajinjajan :
Udah bisa guys sekarang 😭
2026-06-29 04:28:08
0
jai_auroecis
Mas Jai :
tp aneh nya ada view nya ....kok bisa gtu looo
2026-06-28 12:36:30
2
nuryahligd2019
Hafsahmaryah22 :
Bang,, bisa gak 2 akun Shopee dengan upload video yang sama persis?? semoga dibalas 🙏🙏
2026-06-28 14:05:32
1
annikha__
Anne :
siapa yg masih belum bisa?
2026-06-29 06:04:53
0
prettycatyellow
Zoa :
aku udah nanya cs oren
2026-06-28 14:59:40
0
slaydulugasih
suka matcha🌿 :
kaget banget uda upload trs hapus kirain aku sendiri yg kayak gini rupanya emg semua di qc dulu baru di publish ya😭
2026-06-28 13:05:44
0
goransadesain16
goransadesain16 :
udh terlnjur upld 9 hri ini gmna d hpus apa biarin
2026-06-28 15:23:03
0
ulfa_syaffira
Ulfa_Syaffira :
ya Allah saya kira aku sendiri yang ngalami 😭😭😭😭😭😭 udah 2 hari video tidak muncul di akun orang lain
2026-06-29 05:09:35
1
wildama8
MamanyaQia :
bang terus tetep upload ga nih?
2026-06-28 11:39:13
0
kinandita7000
Kinandita✨ :
terus kalo ada sammpel dan mmg udah mau deadline nya gmna kak😅?? ada 8 sampel dan harus di bikin vidio
2026-06-29 02:29:14
0
meggamayy99
Meggamayy🦋 :
kabarin bang kalo udh ga eror
2026-06-28 18:02:44
1
bundanaarsyamri
bundanaarsyamri :
pantesan udh d upload ko g muncul tau nya error🤦‍♀️mna udh d apusin td😩
2026-06-28 17:28:54
3
bayuboyshiddiq
Bayu96 :
benar sekali bang kaget sayaaa 🥲🥲🥲
2026-06-28 12:25:47
0
herlina_selin
Herlina Selin :
yahh bang kirain saya kenapa😭 udh saya apus 3 video😭 ,, maklum pemula ga ngerti
2026-06-28 12:00:22
0
papidruuu
Ndruuu :
iya dari tadi subuh aku chat cs dibilang tunggu 1x24 jam bang, katanya ada beberapa kreator yang mengalami masalah ini, ternyata hampir semua ya 😂
2026-06-28 13:45:48
0
n_oktavia23
tacikk💤 :
aku kira aku kena planggaran cek kesehatan bagus. tapi aku hapus takut kena planggaran 😭
2026-06-28 16:05:23
1
chartono_nagaorange
NAGA ORANGE :
nahhh senasib
2026-06-28 12:14:40
1
To see more videos from user @iyandris, please go to the Tikwm homepage.

Other Videos

My friend is dancing. 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. . . . . ib : @burka0783  #fyp #fyppppppppppppppppppppppp #foryou #foryoupage #trending
My friend is dancing. 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. . . . . ib : @burka0783 #fyp #fyppppppppppppppppppppppp #foryou #foryoupage #trending

About