@theonlyoneaustinkuda1: Peter Obi shocked Rufai as he responded to critiques about the money he left in Anambra State. #creatorsearchinsights #peterobi #anambrastate #goviral #nigerian

theonlyoneaustinkuda
theonlyoneaustinkuda
Open In TikTok:
Region: NG
Saturday 21 March 2026 15:48:59 GMT
18688
1009
51
18

Music

Download

Comments

kaaba0147
BIG___KAABA🤏🏿 :
I love Peter Obi so much The best governor my state has ever had no Governor was more working and truthful than fmr governor Peter Obi 🫶🫂
2026-04-16 16:08:58
18
eazymayorshow
EAZY MAYOR :
nobody is perfect but he's much preferable than others
2026-04-19 15:23:32
11
habila999
Habila :
How many independent power plant did you build before leaving office is? How many machine did you installed in those hospitals around anambra.
2026-03-21 20:55:55
1
jocarlyslens
Jocarly’s Lens :
The man of our dreams
2026-03-21 22:52:58
15
kkilodubajnr
Father of Ravens :
you are a blessing to Nigeria. If it is the will of God, you will be president!
2026-03-21 21:42:02
12
noni53677
noni :
no past governors can compete with obi
2026-04-19 02:58:22
5
cyreno1
cy reno :
these is Nigeria president
2026-03-26 22:10:55
5
greatkoe
Great KOE :
Obi my ancestors will bless you 🙏🏿🙏🏿
2026-06-17 13:21:24
1
emeka_256
Emeka :
Alex Otti confirm it and many others
2026-06-06 13:35:52
0
barcitybyagpro
agpropertiesltd :
louder 👂
2026-06-05 18:08:50
0
iphonelordz
iPhoneLordz :
I m waitin to see any comment sayin its a lie
2026-03-29 15:42:52
4
msmchannel5
msm :
My president ❤️❤️❤️
2026-03-21 17:15:32
1
luchydesigner
luchydesigner :
Man is too clean ✨❤️
2026-05-16 08:02:53
3
jayscott755
jayscott755 :
Why is Rufai always directing questions at Obi? Has he ever put the same kind of questions to Tinubu?
2026-03-21 17:40:02
1
effiongasuquo5
effiongasuquo5 :
why were you savlng money when allot need be done
2026-03-31 11:44:33
4
st.demmyconcept09
KAYBEE :
because you didn't do any projects, but doctors are on strikes for 11 months
2026-04-12 14:23:56
0
wallingiyke1
wallingiyke :
That's a man of integrity
2026-03-21 19:14:00
3
ndushirley
Amaks :
hmm and one tenure the whole money finished this country this is why they don't like him because integrity choke.
2026-04-05 14:53:17
2
obsaintz
OB SAINTZ :
Plss let us support this man Peter obi is crying for the goodness and wellness of our Nigerians
2026-06-10 09:49:13
0
onyebuchifranklin4
SEAKING :
🥰
2026-03-23 08:28:20
0
adama.alefe
Adama alefe :
😏😏😏
2026-06-18 12:58:52
0
onyebuchifranklin4
SEAKING :
❤️
2026-03-23 08:28:20
0
smilinggeorgia457
georgedikeogu :
👀
2026-03-28 14:07:39
0
To see more videos from user @theonlyoneaustinkuda1, please go to the Tikwm homepage.

Other Videos

Dance🫡 #iqmaxx  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. #larp #333 #sinister #dwbi
Dance🫡 #iqmaxx 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. #larp #333 #sinister #dwbi

About