@abasesay: salonetiti #StandwithGod #gracespeakesbetter #dontplaywithme ♥️💙💙

Unbeatable bae💪🏽001
Unbeatable bae💪🏽001
Open In TikTok:
Region: GB
Wednesday 24 June 2026 16:13:04 GMT
22128
2664
150
279

Music

Download

Comments

satubella001
🦋💫🎀𝕾𝖆𝖙𝖚𝕭𝖊𝖑𝖑𝖆🛐✨🌙 :
Dis all no make sense 😂😂😂
2026-06-24 17:28:08
6
rama00588
Rama🧚‍♀️🕷️🪰🦋 :
I really love this woman 🥺🥺
2026-06-24 17:07:21
4
alie.kuwait.bangu6
Alie Kuwait Bangura :
keep on my dear sister prayer 🙏 is the king
2026-06-24 20:54:11
0
mariamdallan
.Maja :
abalicious we moveee 💪❤️🥰
2026-06-24 17:23:31
3
queenscorpion743
Lera❤️💗💕 :
Yeeeeeeee Team Abbalicious
2026-06-24 17:46:30
1
braj5574
Bra-j :
Proud of you good mum of 4 lovely boys.
2026-06-24 16:49:38
1
dia_mond3872
Diamond Queen 💎 :
Well said my sister 🥰
2026-06-24 20:05:51
0
baby.0.65
baby 0.65 :
Ameen and Ameen
2026-06-24 20:50:17
0
memunatusesay1542
Nurse Memzo :
so true darling ❤️
2026-06-24 17:19:55
1
abdaco0
abdaco0 :
Facts 😍😍😍
2026-06-24 16:19:56
0
sesaythank
Capricorn queen ♑️🍀🍀🍀 :
that is grace my dear,you are really a strong woman
2026-06-24 18:26:12
0
itzmarykoroma75
Mary🌺💯 :
Happy anniversary
2026-06-24 17:02:06
1
josephinetarawall
josephinetarawall :
pastor Abba 🥰🥰
2026-06-24 16:34:44
0
satubella001
🦋💫🎀𝕾𝖆𝖙𝖚𝕭𝖊𝖑𝖑𝖆🛐✨🌙 :
Y u no dae go straight to the point😩
2026-06-24 17:22:56
2
saidu.turay92
Your future is my pastence :
True talk sis
2026-06-24 20:41:46
0
hk334hk
hk133 :
Happy anniversary
2026-06-24 19:58:21
0
bintutejan696
Bintu Tejan :
beautiful ❤️
2026-06-24 20:26:48
0
ladybspecial30
Mama for the boyz :
true tok my darling 🥰
2026-06-24 20:25:13
0
assiatumansaray5
BlessedRimaDoez :
You are bless Queen Abba
2026-06-24 19:31:08
0
jujukaybaby0
juju Kay baby 💋💋🖕 :
beautiful 🥰
2026-06-24 19:28:03
0
womanwithpride1
Mum jay♥️♥️♥️ :
Sure my sister ,you are always blessed 🙏🙏🙏❤️❤️❤️
2026-06-24 19:32:55
0
ferinam16
mafa :
my dear you don't need to say anything, just take care of your children that's all
2026-06-24 20:54:34
0
jamilatujames
JJ Enterprise :
so true sis
2026-06-24 19:31:29
0
babytutu44
babytutu44 :
God bless you my sister
2026-06-24 19:47:17
0
user8495428219761
Muna baby :
you look beautiful ❤️❤️🥰🥰🥰
2026-06-24 20:17:49
0
To see more videos from user @abasesay, 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  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. Using Knuth's up-arrow notation, Graham's number is  g 64 {\displaystyle g_{64}},[1] 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.#humanity #269 #tcd  #tjd #rampage
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. Using Knuth's up-arrow notation, Graham's number is g 64 {\displaystyle g_{64}},[1] 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.#humanity #269 #tcd #tjd #rampage

About