@lucy.muthoni10:

Lucy. muthoni
Lucy. muthoni
Open In TikTok:
Region: KE
Friday 03 July 2026 18:26:59 GMT
7191
940
24
14

Music

Download

Comments

johnnjuguna8738
John Njuguna :
blessed backwards
2026-07-13 11:56:04
0
bensonstephen351
benfun :
follow back
2026-07-13 17:54:43
0
user6916679528109
Jerry selector :
my beautiful 🔥🔥🔥🔥
2026-07-12 17:28:18
0
meekwilliams3
PUREBRAND INTERIOR FINISHES :
Capital D 🥰
2026-07-13 20:11:49
0
www.jimcutter
Jim Cutter :
Hi❤️💕❤️💕❤️😜👍
2026-07-10 18:56:14
0
justin.joseph23
Justin Joseph :
2026-07-11 05:33:04
0
bichah.g
Bichah.G :
No comment
2026-07-09 15:47:37
0
stargrl_official
⭐ girl :
I like
2026-07-03 20:03:25
0
charlesokello12
Charles Thomaso 🇰🇪🇧🇭 :
the movie is always interesting when you watch behind the scene
2026-07-03 18:32:41
0
dsmart43321
D SMART 🤓 :
❤️❤️❤️ur good
2026-07-03 18:34:12
0
manchao79
manchao79 :
wow ❤️
2026-07-03 19:19:03
0
ayubu7466
Ayubu :
So beautiful
2026-07-03 18:34:23
0
josephmwangi1636
josee :
so beautiful ❤️❤️❤️😻
2026-07-03 18:32:10
0
sanjaynashkar1
Sanjay Nashkar713 :
2026-07-03 19:17:02
0
cal8f
calif :
NYUMA IKO SAWA🥰🥰🥰
2026-07-03 18:53:28
0
stargrl_official
⭐ girl :
🥰🥰🥰wow
2026-07-03 20:03:09
0
semychibz
SEMY CHIBZ :
my size my type
2026-07-11 07:18:18
0
user1226227855628
user1226227855628 :
hi long time WhatsApp me ppz
2026-07-11 13:16:16
0
steelmetal254
Santos-AE :
🥰
2026-07-04 10:11:29
0
johnsonselei3
Yom12 :
💕💕💕
2026-07-03 21:20:04
0
franciskimathi
Apstle Francis K Kimathi :
💖💖💖
2026-07-03 20:22:46
0
ramsy8832
Ramsy :
❤️❤️❤️
2026-07-03 18:33:01
0
solomonmmm
suleiman sumare :
🥰🥰🥰
2026-07-03 18:31:20
0
user4311546131986
davido :
😜😜😜
2026-07-04 05:14:50
0
To see more videos from user @lucy.muthoni10, please go to the Tikwm homepage.

Other Videos

#131 #ancap #anticommunist 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.
#131 #ancap #anticommunist 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.

About