@verlostrades: What is your mentality? #trading #forex #daytrading

Verlos William

Open In TikTok:

Region: NG

Thursday 16 April 2026 21:57:36 GMT

7170

1145

24

24

Music

Download

No Watermark .mp4 (4.32MB) No Watermark(HD) .mp4 (5.52MB) Watermark .mp4 (11.63MB) Music .mp3

Comments

Mario. :

I see you're upgrading your drawings

2026-04-18 13:25:51

12

Osaro Julius :

The difference between a struggling trader and a consistent one isn't the strategy — it's the identity.

2026-07-05 02:18:08

1

2Young :

Thank You Brother For this

2026-06-01 23:42:11

0

MEG@TRON :

No other way to say it better Thank you man

2026-04-17 03:46:50

0

Innovative Mastic :

I really never regretted following you, sir.

2026-06-18 16:54:08

0

KUNAZ :

How do we not notice how good his comic drawings at the edge of the board are...

2026-04-17 00:05:37

3

💱 KRIXXUSDT💻📚📈 :

I love your videos

2026-05-24 06:46:26

0

𝓜𝓻. 𝓔𝓭𝔀𝓲𝓷 𝓓𝓪𝓻𝓴𝓸 :

Love your content bro

2026-06-01 16:54:01

0

Unreal🌏 :

hmmmm

2026-06-15 10:00:40

0

AYOOLA WEALTH HUB :

my boss.....well spoken

2026-04-18 09:27:14

0

Destiny :

Really appreciate you 🙌🙌

2026-04-17 21:55:55

0

Mand€€🦅 :

no be joke oh

2026-05-23 10:26:44

1

B I G D A V E :

God bless you jare senior man

2026-04-16 22:59:54

0

Abdulmalik :

nice lectures sir but ur good at drawing faces oo 😂

2026-04-17 00:08:48

0

BENJAMIN☠☠JAY💀💀 :

understood

2026-04-24 05:31:06

0

VIRGIN_SOUND,V_WAVE SOUND 🔊🎵 :

thank u sir

2026-04-18 22:28:19

0

Trip_A Fx📈📉 :

Great one

2026-04-17 12:34:34

0

49 :

Great 👍

2026-04-17 05:35:35

0

Bryan Angilo :

thanks bro

2026-07-07 09:47:51

0

FutbalUniverse :

Powerful message as always

2026-04-16 22:05:29

0

Chrisbex :

💯

2026-04-17 23:14:26

0

X Live :

👏👏👏

2026-04-16 22:01:13

0

swhy :

🥰

2026-07-03 11:43:06

0

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

Other Videos

Graham's number is an immense number that arose as an upper bound in the answer to 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' number, which is itself 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 each digit occupies a Planck volume. But even the number of digits in this digital representation of Graham's number would itself be so large that its digital representation could not be represented in the observable universe. Not even the number of digits of that number, and so on, repeated a number of times that vastly exceeds the total number of Planck volumes in the observable universe. Thus, Graham's number cannot be expressed even by physical power towers on the scale of the universe of the form: a^(b^(c^(...))) although Graham's number is in fact a power of three. However, Graham's number can be explicitly given by computable recursive formulas using Knuth's up-arrow notation or an equivalent notation, as was done by Ronald Graham, after whom the number is named. Since there is a recursive formula to define it, it is much smaller than typical busy beaver numbers, whose sequence grows faster than any computable sequence. Although far too large to be computed in full, the digit sequence of Graham's number can be calculated explicitly through simple algorithms; the last 10 digits of Graham's number are 2464195387. Using Knuth's up-arrow notation, Graham's number is g₆₄, where: g₁ = 3 ↑↑↑↑ 3 gₙ = 3 ↑^(gₙ₋₁) 3, for n ≥ 2 Graham's number was used by Ronald Graham in conversations with the 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 used in a published mathematical proof. The number was featured in the 1980 edition of the Guinness Book of World Records, increasing public interest in it. Since then, other specific integers known to be much larger than Graham's number (such as TREE(3)) have appeared in serious mathematical proofs, for example in connection with various finite forms of Harvey Friedman's version of Kruskal's theorem. Furthermore, smaller upper bounds have since been proven valid for the Ramsey theory problem from which Graham's number was originally derived. #fyp #fy #tcc #51

Graham's number is an immense number that arose as an upper bound in the answer to 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' number, which is itself 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 each digit occupies a Planck volume. But even the number of digits in this digital representation of Graham's number would itself be so large that its digital representation could not be represented in the observable universe. Not even the number of digits of that number, and so on, repeated a number of times that vastly exceeds the total number of Planck volumes in the observable universe. Thus, Graham's number cannot be expressed even by physical power towers on the scale of the universe of the form: a^(b^(c^(...))) although Graham's number is in fact a power of three. However, Graham's number can be explicitly given by computable recursive formulas using Knuth's up-arrow notation or an equivalent notation, as was done by Ronald Graham, after whom the number is named. Since there is a recursive formula to define it, it is much smaller than typical busy beaver numbers, whose sequence grows faster than any computable sequence. Although far too large to be computed in full, the digit sequence of Graham's number can be calculated explicitly through simple algorithms; the last 10 digits of Graham's number are 2464195387. Using Knuth's up-arrow notation, Graham's number is g₆₄, where: g₁ = 3 ↑↑↑↑ 3 gₙ = 3 ↑^(gₙ₋₁) 3, for n ≥ 2 Graham's number was used by Ronald Graham in conversations with the 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 used in a published mathematical proof. The number was featured in the 1980 edition of the Guinness Book of World Records, increasing public interest in it. Since then, other specific integers known to be much larger than Graham's number (such as TREE(3)) have appeared in serious mathematical proofs, for example in connection with various finite forms of Harvey Friedman's version of Kruskal's theorem. Furthermore, smaller upper bounds have since been proven valid for the Ramsey theory problem from which Graham's number was originally derived. #fyp #fy #tcc #51

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

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

الأسطورة لم يتمالك نفسه عند ترديد الجمهور بأسمه 😞🇦🇷💔.#ميسي🇦🇷 #الأرجنتين🇦🇷 #fyp #foryou #ليونيل_ميسي_ساحر_كرة_القدم

الأسطورة لم يتمالك نفسه عند ترديد الجمهور بأسمه 😞🇦🇷💔.#ميسي🇦🇷 #الأرجنتين🇦🇷 #fyp #foryou #ليونيل_ميسي_ساحر_كرة_القدم

الرجل حينما يحب المرأة #سعد_الرفاعي #fyp

الرجل حينما يحب المرأة #سعد_الرفاعي #fyp

اذكار الصباح والمساء #دعاء_يريح_القلوب #موعظه_دينية_مؤثرة #كلام_من_ذهب #اجر_لي_ولكم #fyp

اذكار الصباح والمساء #دعاء_يريح_القلوب #موعظه_دينية_مؤثرة #كلام_من_ذهب #اجر_لي_ولكم #fyp

so i’ll never hate @Wizz App

so i’ll never hate @Wizz App

About

Robot
API

Legal

Privacy Policy