@commoduswife: erm i have 0 motivation to edit cause im sick but i’ll try to make one later 😞 #gladiator #joaquinphoenix #2000s #commodus #edit #relatable #foryou #foryoupage #dontletthisflop #oldermen #husband #viral #majestic #villain #trending

adele
adele
Open In TikTok:
Region: SE
Sunday 25 August 2024 08:12:30 GMT
614735
45972
180
2034

Music

Download

Comments

elmineraudajoki
🩶 :
Brother forgot about Jamie Lannister 🙏
2024-09-04 13:39:04
434
therealshamu3
🇬🇧 :
Feel bad for irl commodus tho bro a victim
2024-09-19 09:15:37
196
clementine_rbt
Clémentine :
him and Anakin
2024-09-15 19:48:26
414
addison01214
addison³ :
He’s gorgeous fr
2024-08-25 09:31:03
723
pyroliciousss
🥀𝒜𝓃𝓎𝒶🖤 :
Him, Anakin, & Jonathan Crane tho 🙏🏻🙏🏻
2024-10-21 18:43:14
69
supermyke_64
•Michael• :
is so hateful...but...is so pretty
2024-11-20 23:22:23
56
miii.e3
𝑚𝑖𝑖 :
I love him
2025-08-22 12:56:38
36
commodussy
Commodussy :
He’s not a want—bro’s a NEED 😩😩
2024-11-21 22:15:11
6
wnndyying
Ami🩵 :
I thought I was tripping in 10th grade. I knew I was right
2024-09-13 12:47:38
88
james_b0wers547
James_B0wers547 :
His armor is cold
2024-08-28 08:15:09
25
aniqcc
𝓅𝑜𝓇𝒶𝒹𝓎 𝒷𝑒𝒶𝓊𝓉𝓎 :
the way I gasped when I saw him for the first time 😫
2024-08-29 20:19:57
41
1ts.m4rg0
Akii 🇭🇷 :
This is making me want to watch gladiator 1, i already watched the 2nd one and im in love with geta
2024-11-28 21:09:41
26
g4bb_zy
❦𝕲𝖆𝖇𝖇𝖞❦ :
im married to him btw if you even wanna know ^^
2024-09-20 09:15:20
26
ru_8y
Ruby𖣂︎ :
Younger me knew what was up when watching this
2024-10-11 22:45:39
14
lazaruszx
lazarus :
need him
2024-09-04 10:18:06
16
leo_outdoor391962926191
⚯͛_Leo_𓅓 :
nah its anikin skywalker
2024-12-13 09:48:37
6
barbicpd
𝐵𝑎𝑟𝑏𝑖 :
el papá de mi gata🤭
2024-08-27 04:25:35
22
1ts.m4rg0
Akii 🇭🇷 :
If anime boys dont count then yes
2024-11-25 19:56:05
5
televsssionn
laceheartz 𓊆ྀི❤︎𓊇ྀི :
He kinda reminds me of Lorenzo Zurzolo
2024-09-18 06:46:03
73
ann48312
Andrea4832 :
mí imperio romano 🥰
2024-11-19 19:39:47
6
saluu6969
saluu6969 :
Imagine kaiser nero playes by him😍
2024-08-25 09:27:54
88
diegogarrido288
diegogarrido288 :
que película es
2024-09-17 00:42:34
7
httkii
zara 🍂 :
REAL
2024-08-25 09:44:00
7
aphroditeee.lola22
Babydoll :
him casually serving 100/10 face card
2025-06-17 01:59:52
4
To see more videos from user @commoduswife, please go to the Tikwm homepage.

Other Videos

#сатанизм #sinister #targetaudience #theisticsatanism   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 scienceMartin 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 FriedmanKruskal'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.
#сатанизм #sinister #targetaudience #theisticsatanism 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 scienceMartin 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 FriedmanKruskal'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.

About