@icantkeepgoin: I’m getting sick of this 😂😂 #real #fyp #relatable

icantkeepgoin
icantkeepgoin
Open In TikTok:
Region: US
Tuesday 01 September 2026 16:16:18 GMT
95510
16045
308
2399

Music

Download

Comments

forsaken.larper
forsaken larper :
"ready for school?" yes dad I'm ready to get made fun of for 6 hours and 30 minutes😀
2026-09-02 02:50:52
962
alexander_productions1
that_peasant_guy :
we're just slaves at this fucking point🤣🤣😂
2026-09-02 04:36:06
970
brembo_lifts
brembo_lifts :
Wakeup go to school come home go to gym go to sleep 😭
2026-09-02 09:42:05
1
userilrkit8xb7
Kirk jeager :
Replace school with work
2026-09-02 09:45:25
1
trumarko
TruMarko :
You forgot to slow down after go to school and speed up at come home
2026-09-02 02:47:00
66
luvisinn
✝️em✝️ :
ts is not ouroboros💔
2026-09-02 03:06:56
3
lqjskwms
🚬 :
5 more days and hell starts😂😂😂😂
2026-09-02 09:24:37
7
mr___snake
Mr. Snake :
growing up is realizing school is not that bad
2026-09-02 05:02:01
37
9281acc
name :
Wake up>Go to school>Come home> Go to work>Go to sleep And then my mom gets mad at me when I play games at night like when can I play if im everyday busy
2026-09-02 08:53:38
10
22murr
hi. :
But there it’s so peak
2026-09-02 05:52:14
76
monster_cat07
monster_cat :
“Ready for school?” Yeah mom, I’m ready to walk to hell on earth, get marginalized for 8 hours, walk back home, knock out, and repeat for a hundred and seventy-something days
2026-09-02 04:49:03
9
aiden3737111
Aiden725 :
Then do something in or after school: join a club, play a sport or just find a passion that makes each day different!
2026-09-02 04:57:17
8
ryu102947
Ryu :
Online school is speak
2026-09-02 05:38:44
32
volt4497
volt :
0 friends new teachers idk anybody, ima make this year my bih
2026-09-02 08:19:40
5
ripvanwinkle_26
ripvanwinkle_26 :
Risky repost
2026-09-02 04:24:26
5
shockwavefan1111
Shockwaves #1 fan :
So far so good, I’m getting up on time, completing my work. I dread the inevitable day I get burnt out and plummet like last year
2026-09-02 04:42:37
7
r_u_still_ther
Shibbylandcitto✌️😂 :
For me I have to wake up at 6:00 go get ready go to school come home go to jujitsu go do homework and shower and sleep like everyday my life is a loop dude I'm tired of it
2026-09-02 04:17:44
5
qvqv120
qvqv :
2026-09-02 02:40:18
7
To see more videos from user @icantkeepgoin, please go to the Tikwm homepage.

Other Videos

Graham's number is a very large 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 #hERo #elliot #rogger #ER #iqmaxx
Graham's number is a very large 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 #hERo #elliot #rogger #ER #iqmaxx

About