Day 9
day 9
1:29 am, 11 september 2025
lmao its time to start living the dream life, learn tons of math, cs, wtv the fuck you want to, build cool ass projects that get you notereeity and just have fun every single day while being completely locked in. lest go man. Mony's Jannik Sinner era starts right now, in jan 2018 he was completely average , not even ranked.
he won his first match and got a really average rating. like ~1500, which is what i think im ranked in the world right now. Then within one year, his skills were unrecognizable, and he was playing in the us open, and within two years, he won the next gen atp finals.
This is exactly whats finna happen w me now, altho my next gen finals is prolly gonna be YC :D
in ammy's right now , studying AIMA, ill talk later, right now i wanna studyyyyyyyyy
2:30 am
ok so the cafe closed so im back in my hostel, about to sleep now, but i wanna talk about a couple htings
the ai class is actually cool and is taken by prof. mausam, whos an actually good researcher. i mean it's also kind of the perfect startupy topic in the 60 day challgenege so i mean yessirski lesgo ! there's an assignment for this class which is due two days ago, so im thinkning i wanna catch up w the class, learn some interesting math and do the project, so today, day 8 thats what i'll do, for a sense of urgency or soemthing, i guess lets challenge myself to complete this today.
well yeah thats pretty much it, lets go be the best ever every single day man. lets go live out our dreams now :D
8:35 pm, 9/11/2025
i was distracted in the morning, but then i jsut said to myself:
yuh thats it bruh, lets go do everything we've ever wanted man. Geographer skyscraper on loop. Jannik era starts nowwwwwwwww
11:35 pm
mannnn im tripping lmao, I was trying to understand Lovasz local lemma (woohoo bruh, when i had started oly, this shit seemed mystical lmao) and chatgpt gave me a stupid ass example about 2-colouring k-uniform hypergraphs while remaining monochromatic. I mean so I was like lemme just think about the complete k-uniform hypergraph, cos $\chi$ of this graph would obv be higher than a normal graph. then i was like for $n \ge 2k$ this is obv not possible, and I thought I was some genius or someshit when I used LLL to prove that for $n \le \frac{k}{e}$ you can 2 colour it.
But I'm genuinely being a retarded ass bitch man, i gotta focus and work so fucking hard cos this was genuinely bullshit. by the end of thsi year i wanna have actual tangible progress both in what my level is and some cool achievements. dw, asia #1 in smmc is coming up in a month nigga. fuck you. i gotta get this shit man, lets do this deal, right here, right now, you deserve to achieve all your dreams, if and only if you work all fucking day every single day, completely locked in, no distractions. i will get my jannik sinner getting ranked moment by being smmc asia #1 and then thats just gonna be the fucking start bruh. i swear to god i wanna be the best ever and then drop out of this place and be a biliionaire, go make it happen twin.
but yeah, the hypergraph thingy, the answer is obv just for $n \ge 2k-1$ you can't colour it, cos atleast $k$ of these will be red then, adn just take that edge; and for $n \le 2k-2$ you obv can where oyu just use each color less than $k$ times.
I was very mad then, so I went to the wikipedia article to see what the fuck LLL actually is,
like I get these niggas say if $epd \le 1$ then none of the events occur with non zero probability ; but how the fuck do you calculate $d$ and get good bounds, where the fuck do you do this, they gave some retarded ass example of $11n$ points on a circle, $n$ colours used equal number of times. prove you can select $n$ points of different colours such that no two are adjacent.
I couldnt think straight about this problem, so i just ragequit and went to play basketball w the first year kids. that was fun, when i was talking to my year kids tho, thats when it really hit me like, im going to drop out of this place, i need to be the best ever bruh, like when these ppl look at me they shoud be liek how the fuck is he sooooo fucking good. thats it. aint nobody can question my decisions bruh, lets fucking go. I scootied around the campus (the shopekeeper bhaiya gave his scooty lmao) and yuh I just decided I am going to lock in and really live my dream life, and hence achive all my dreams right fucking here. I have decided no distractions at all, so like no internet, no talking to bitches, no ig, nothing, just me studying cool shit all day, and living the dream.
im back in my room, life is perfect, lets go do some math now huh. Let's understand what Lovasz Local Lemma is all about ^_^
1:57 am 12 September
censorship in ai models actually sucks, ill do something about this. right now tho, thats it man, start and never ever stop.
2:29
you know i watched a lil bit of the socail network right now. this is really it, this is what i wanna do wiht my life, but even bigger and better. lest get to work then brodie ;) just have fun and I WILL NOT STOP now. mpnvoc. this shits on me now, go get it gng.
2:53
ooooh goddamn so this is how LLL works haha... this shit is ez
a couple of quick examples via chatgpt ^_^
$\chi(G) \le e(2\Delta - 1)$ where ofcourse $\Delta$ and $\chi$ are the usual meanings, max degree and chromatic number (actually im not finna explain notation from now on, just ask ai if you dont get it lmao)
anyways; the proof is very simple once you understand LLL
Say you have $q$ colours. Randomly colour the vertices.
Let event $E_i$ be that the $i^{th}$ edge is monochromatic.
Cleraly, $\mathbb{P}[E_i] = \frac1q$
Also, clearly , the fact that edge $i$ is monochromatic only affects at most $2(\Delta-1)$ vertices. (so dependency graph of events has max degree $d \le 2(\Delta-1)$
Then we just require $ep(d+1) \le 1$ we see that as soon as $q \ge e(2\Delta - 1)$ this inequality holds true, so LLL implies that the probability that none of the events $E_i$ occur is non zero ^_^
goddamn, this shits too overpowered. But also goddamn i wanna work so much harder. bruh the graph theory dream, diestel, i should have studied so much of diestel already. im not making that mistake, no regrets any single day bruh. I should have been knowing all this stuff already, like the tight bounds on $\chi$ but its ok gng, we starting now , and I promise we not stopping bruh
Anyways, the second example, again very simple is, in a $k$ uniform hypergraph, find $\Delta$ that implies for sure that if max degree is less than $\Delta$, we can $2$-color the graph peacefully !!! (btw intuition is to think of hypergraphs as subsets of $\binom{n}{k}$ )
Just compute $p=\frac{2}{2^k}$ and $d \le k(\Delta -1)$
So as long as:
$\frac{2e}{2^k}(k(\Delta-1)) \le 1$ we're gucci, so this gives you like a $\Delta = {O}(k 2^{-k})$ bound.
So btw my intuition increased so much here, if $k=10$, we get $\Delta \le 19$
So what this basically tells us is that in a 10-uniform hypergraph, if each vertex is in at max $19$ edges, then you can always 2-color this graph... So basically like if $n$ (the number of vertices) is very large , ofc you can make the grpah very sparse, which is like just make all the edges disjoint, so that's no use... but we just proved that as long as our graph is sufficiently sparse, (each vertxe in at max 19 edges) , then you can still two color it...
Lmao let me translate this problem into simple language, so i can give this to my friends haha scammmm
Consider the set of all subsets of size 10 of $[1,2,\cdots,1000]$. Call this set $U$. Let $S$ be a subset of $U$ such that each number occurs in at max $19$ elements of $S$. Prove that you can colour each number in $[1,2,\cdots 1000]$ red or blue such that no element of $S$ is completely monochromatic. note that each element of $S$ or $U$ is essentially a size 10 subset of $[1\cdots 1000]$
lmao this was a waste of time, but I like latexing and blogging, and this is my life and i wanna do wtv is fun so who gives a fuck. this is perfect, work so hard and be so locked in that youre either studying or blogging haha... fun life
skyscraper , geographer on loop... lets kepp going!!! woohoo
3:24 am
well chatgpt said CNF something something. but I don't know logic at all, like wtf lmao. but I remember i had seen this shit when reading the chapter on NP completeness in CLRS, and this is the perfect advantage, and the priviliges you earn when youre locked in. becaust i dont give a fuck about anything, at all, and i have decided im. going to work every single second, nothing else matters to me haha. this is so much fun, im literally living the dream right here, just studying wtv the fuck I feel like woohooo lesgoooo
3:52 am
a few thoughts
blocsoc is actually very impressive and fun, theres 6-7 (hahahahhaha) really cool people there ^_^
but yeah I got this interesting Idea, can I make a new cryptgraphy system using a NP problem, like maybe Graphs or something??? interesting idea right woohoo
another is, this life is fun, this song is actually perfect woohoo.
i just feel so motivated bruh, I just wanna learn cool shit all day and just have fun and then build so much cool stuff woahhhh im pumped up.
also another thought it, I can just do this all day right, like tomorrow also, all day I'll either be studying or blogging woohoo
another thing is, i should prolly only blog when im genuinely tired lmao, cos when youre working, the main thing is to accomplish more stuff every day, not blog more stuff (tho both are essentially the same lmao) but yeah this willl be more fun tomorrow when I am studyign the whole day and blogging the whole day in my rest, anyways, lets keep going.
4:42
haha i was looking at some old videos and i could really be an IG influencer lmao, maybe i should do pranks onlne.
i mean I can do whatever the fuck I want to lmao
the np completeness chapter is pretty interesting, I already have good intuition for "reduction" ie proving a problem is hard/easy by proving its equivalent to another problem that is known to be hard/easy. the reason I have good intuition for this is ofc cryptography lmao.
Ok I'm completely sleepy now, so Imma go lie down on the bed now, and imma go to sleep while reading AIMA chapter 2... ill not wake up frm this bed before completing this chapter :D
tomorrow you already know what we doing, like the decision is made man, no internet we working and blogging alll dayyyy woohoo im pumped... jsut one day and see how much you accomplish bro. thatll fuel us so much more to keep going. lesgo bruh.
2:45 pm September 12
I'm up, and I'm getting straight to work... I'm reading AIMA chapter. 2, while listening to Hikari by jishle, and I won't stop till I complete this chapter... life is perfect.
my wallpaper is so inspiring btw... also, i just know that im the smartest kid ever, so dont worry at all about anyuthing, ill catch up w the ai class and more in 2 days, idgaf about thsi college so my grades dont matter ,like what would you even do with caring about college? get a good job? lmao; just go live out your dreams. i need to be the best in the world, nothing else matters. lesgoooooo now
3:51 pm
ok so i opened whatsapp and some kid had asked:
given 17 integers, prove there exists a 9 size subset of them summing to 9. I found a really cool solution:
haha im very happy with this. pretty cool... also look at this:
lmaoooo this is funny
bro but most niggas in college are actually retarded haha.
Anyways, I found out this is EGZ problem... i looked it up on wikipedia and some really cool math happens here... cauchy davenport, combinatorial nullstelenzatz woohoo lots of cool stuff i wanna do bruh
4:54 pm
well lots of fun stuff I looked up, all of this, algebraic combinatorics, combinatorial nullstellensatz, cauchy davenport and in general this stuff seems so fascinating damnnnn... lol this is so much fun like actually, i can do cool math and become the best in the world??!!! literally my dream...
I don't feel like doing the AI book here, so I am going to Ammy's to eat and I will study it there... lets fucking go man, life is soooo good
I sent this message and like perfect right, just do cool shit and enjoy life
anyways lets go lock in and work now bruh!!!
5:48 pm
yessirski, we're here at ammy's now. life is actually just perfect, go live out your dream life right here then
like right at this moment, life is actually perfect, we're locked in, no distractions, making progress. this right here is where you gotta work your absolute hardest and just lock in and grind right. literally right here is where i earn my billions. letsgo
6:43 pm
I solved another math problem:
show that if 100 integers are chosen from 1,2, ... ,200,
,and one of the integers chosen is less than 16, then there are two chosen numbers
such that one of them is divisible by the other.
my solution is this:
let the set of 100 numebrs be S...saare 100 numbers ka odd part different hona chahiye, since theres 100 odd parts, all 100 numbers have exactly all odd numbers under 200 as their odd parts. ab jo number under 16 hai, uska odd part assume karo x hai, if x=9,11,13,15; clearly uss. number ka even part 1 hoga (like 2^0) ; so consider 3x ... ek na ek number ka in S odd part 3x hoga, and uska even part obv atleast 1 hai so we're done... now do the same thing, like agar x=5,7 hai, then even part is at most 2, (2^1); so consider 3x and 9x. (2x<16 => 9x<200) ... 3x wale element ka even part 0 hona padege also 9x wale ka bhi zero hona padega, so 3x wala element divides 9x wala element, we're done. x=3 and x=1 ke liye bhi same cheez kar lo woohoo
7:18 pm
ok we locking in again, i saw thhe social network classroom scene
actually so fucking inspirational bruh, this is my life... lets go work now... come on, we're happy, but right now just lock in and DO NOT STOPPPPPPPPPPP.
urgency woohoo
skyscrpaer geographer on loop. i am starting again to read ch-2 and im not gonna stop at all. jannik arc
7:47 pm
hahhaa this is a problem. its ok, just lock in and work.
8:36 pm
I played a game of NBA 2k, well half a game, but yeah we're back to it now
9:14
This is kind of crazy right, im so fucking good at math. like this is literally a superpower bruh. im so fucking talented. i can actually be the best there has ever been, i can actually be the whiz kid billionaire of the world. maximise your potential bruh, aint no way im not doing this.
9:59 pm
bro im progressing so fucking slow its actually kinda crazy. wtf man, actually mad bruh
"uncertainty from ignorance feels like non determinism"
10:56 pm
woohooo im making good progress now, who knew the key was to just :overdo it: which means that like im not stopping for even a single second, like im thinking and thinkng and not checking whatsapp or taking a break at all, just non stop thinking.
11:52
hahahhahahhahha nigga you tripping, im just learning whatever the fuck i want to learn right. literally i am living my dream life, i wanna learn AI so I am learning aI. you relaly just gotta hve fun witht hsi shit man