@justssofiaa:

𝑠𝑜𝑓𝑖𝑎
𝑠𝑜𝑓𝑖𝑎
Open In TikTok:
Region: FR
Friday 23 January 2026 06:19:57 GMT
1230955
174802
1074
11353

Music

Download

Comments

v_hg080
𝓵.𝓵𝓲𝓪 :
nan mais au secours
2026-01-23 12:31:15
9033
jade_premium124
𝓙𝓪𝓭𝓮 🍋✨ :
Moi aussi je veux être belle ..
2026-01-23 15:02:41
3198
alois26kk1
Al's 26kk 🥷 :
Croyez pas c’est a moi quel fais des coeur
2026-01-23 06:25:21
5371
pr1vx_car
PRVSAX :
Elle sait ce qu’elle fait
2026-01-23 23:38:48
750
ilovvape
Fl0w_rs ☀️ :
Faut apprendre à respecter les femmes un jour.
2026-01-23 19:32:52
993
arthur_vdp
Arthur Vdp :
De bon matin comme ça 🥰
2026-01-23 06:24:16
886
justn_mra
Justiine :
☁ 🪂 ✈ ☁ ☁ 🏢__🏨_🏢🏬_🌴_🏠🏡🏠__🏥🏫__  🌲  /🚖🚔 \🌲🌴🌳🌲 🌴  / 🚘  🚖 \🌳🌲🌲🌳 🚦 / 🚔🚘 🚔\ ︎🚏 liker ma ville svp
2026-01-25 15:06:11
282
miboxe1
miboxe :
2026-01-24 08:57:25
248
zhd_0375
𝒍.🫆 :
deux ambiance
2026-03-14 20:19:40
193
ks_fdn1
ks_fdn1 :
Imaginez son daron tombe dans les comms…
2026-02-17 14:20:32
140
lna31102
𝑳𝑴’🥂 :
Mais wtf des dalleux
2026-01-29 21:02:31
107
prince.d.g
Prince🇻🇦 :
c'est malheureux...
2026-02-08 22:52:59
53
als.daii
𝐚𝐥𝐬’ :
Sinon ca perce pas
2026-02-22 23:21:44
11
amira_omrv
amira_omrv :
Je suis choqué des gens dans les coms elle a juste mis un débardeur jsp
2026-02-09 23:27:02
109
user_92z32
🫧 :
Jpp elle
2026-03-08 21:48:53
5
cherrygraciess
𝑔𝑟𝑎𝑐𝑒𝑒’ :
Au pire la beauté des femmes ça s’compare pas?
2026-02-22 21:23:15
58
dd94517
𝑫𝒆𝒍𝒑𝒉'🛸🐬 :
moi aussi jveux être belle.......
2026-02-23 21:57:18
12
intvbl_user
￴ ￴ ￴ ￴ ￴￴ ￴ ￴ ￴ ￴ ￴ ￴ ￴ ￴ :
bdh
2026-01-24 18:08:47
331
user.69420011
user.69420011 :
Sinon sa perce pas ...
2026-01-30 09:27:02
75
usy_93b
𝒰𝓈𝓎“🥥 :
oulaa
2026-01-25 01:37:34
154
urfav.lpx
𝐋𝐩𝐱🙊 :
Puis au fait jsuis pas belle..
2026-01-25 05:53:10
58
s_carspotting
s_carspotting :
2026-01-23 06:24:21
169
yask062k
Y.sko💥🖤 :
Heureusement que certains la respectent parce que cette fille est tellement magnifique et pure et gentille 🥰😍
2026-01-26 12:54:22
10
To see more videos from user @justssofiaa, please go to the Tikwm homepage.

Other Videos

two guys dancing in school (funny right?) | 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 such as Skewes's number and Moser's number, both of which are in turn much, much larger than a googolplex. As with these, it is so large that the observable universe is far too small to contain an ordinary digital representation of Graham's number, 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 Graham's number #taucci #luiz #tccedit
two guys dancing in school (funny right?) | 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 such as Skewes's number and Moser's number, both of which are in turn much, much larger than a googolplex. As with these, it is so large that the observable universe is far too small to contain an ordinary digital representation of Graham's number, 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 Graham's number #taucci #luiz #tccedit

About