@fotmobapp: Virgil van Dijk has started the season in impeccable form for club and country, averaging a rating of 7.5… with ZERO ratings below a 7.0! 🤩✅ 35-years-old, by the way. 😮‍💨 #vvd #virgilvandijk #vandijk #liverpool #ynwa

FotMob
FotMob
Open In TikTok:
Region: GB
Friday 02 October 2026 15:22:56 GMT
63610
12409
102
697

Music

Download

Comments

sirmorgan22
𝗠𝗢𝗥𝗚𝗔𝗡 🇩🇯 :
best center back in football history
2026-10-02 16:00:53
584
blaze_max11
BTB :
36 and still the best cb itw 😭
2026-10-02 17:12:52
248
dacadyarka1
Ismacil_LFC❤️🦁 :
captain virgil van dijk 🧱🔥🐐
2026-10-02 17:28:16
36
lagutta_
LAGUTTA :
greatest defender still standing
2026-10-02 15:30:42
92
kvaratskhhelia01
KvarA⁷⁷ :
my captain
2026-10-02 15:27:10
165
azan_1135
azan _1135 :
36 and the most reliable cb
2026-10-02 19:38:47
23
ibrahimmhossain
Ibo🐅 :
Best CB prime of all time btw
2026-10-02 15:30:49
326
war_thunder603
Jackyboi37 :
The best cb oat
2026-10-03 00:15:35
8
je26265
JE :
Overhated rn
2026-10-02 15:28:02
18
fargo0212
𝓕𝓪𝓻𝓰𝓸🐦‍🔥 :
World best
2026-10-03 05:20:53
0
apddla24
Otavio 🇯🇲❤️ :
BiG VirGil 🧱💥
2026-10-02 16:39:06
13
ge0rge_w10
george :
maguire clears
2026-10-02 15:27:21
12
just.a.user345
Just a user :
goat and mini goat
2026-10-02 19:52:58
12
irishtiro477
Offx!äl🎭Djtîr♤ :
jacquet brought back the groove in him
2026-10-02 20:51:25
5
user2221665022884
abdizo :
no one can stop him vvd❤️❤️❤️❤️❤️❤️❤️❤️
2026-10-03 05:49:51
0
blaqballer
O'mar Vibe's :
stay safe
2026-10-03 04:02:16
0
young_clb
yngg clb 🍀🍀🍀🍀🌿 :
I think he's the best CB so far
2026-10-02 21:17:30
5
l.f.c.1892.11
👑Mo Salah🇪🇬 :
2026-10-02 15:29:50
8
aar_tnj_24.10.2023
R_T🚩 :
best captain right now 🔥
2026-10-02 16:44:55
12
user4965344688654
Ruch :
i know some guy named Keith mason gonna say vvd is the goat
2026-10-02 17:46:12
7
ludvik_hg
Ludvik_HG⚽️🙏 :
Helping a small creator
2026-10-02 15:27:38
9
dhiqayste41
Laderka_garoowe✌️🇸🇴🇸🇱 :
virgal vdd <<
2026-10-02 15:50:08
0
hilaryutd1
Hilary 💫 :
Virgil Van Dijk Is The Greatest CB of all time in the footballing world 🔥🔥🔥🔥
2026-10-02 23:25:04
3
pimbricks
pim the destroyer :
1 goal
2026-10-02 15:41:38
0
edsmondtechtrends
Edsmond trends ✅ :
Wait fr? My solid rock btw 🥰
2026-10-02 20:30:36
1
To see more videos from user @fotmobapp, please go to the Tikwm homepage.

Other Videos

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 of Graham's number are ...2464195387.[1] Using Knuth's up-arrow notation, Graham's number is g64,[2] wheregn={3↑↑↑↑3,if n=1 and3↑gn−13,if n≥2. 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シ #trending #creatorsearchinsights #viral #keşfetbeniöneçıkar @AHMET-İSLAM PASHA @Enverist-pasha ☪ @E7V @𝓢𝓱𝓲𝓻𝔭🇦🇿🇮🇹 @𝐇𝟗𝐫𝐯𝐞𝐧
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 of Graham's number are ...2464195387.[1] Using Knuth's up-arrow notation, Graham's number is g64,[2] wheregn={3↑↑↑↑3,if n=1 and3↑gn−13,if n≥2. 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シ #trending #creatorsearchinsights #viral #keşfetbeniöneçıkar @AHMET-İSLAM PASHA @Enverist-pasha ☪ @E7V @𝓢𝓱𝓲𝓻𝔭🇦🇿🇮🇹 @𝐇𝟗𝐫𝐯𝐞𝐧

About