When you're deep in the mathematical trenches trying to solve a problem and accidentally rediscover an algorithm that's been around since 300 BCE. Our hero Aleksandar just independently derived the Euclidean algorithm—one of the oldest algorithms in existence—by asking if repeatedly applying gcd properties could simplify factorization. That's like trying to invent a better way to slice bread and accidentally creating the knife. The Euclidean algorithm finds the greatest common divisor of two numbers by repeatedly applying the property that gcd(a,b) = gcd(b, a mod b) until you hit zero. It's literally taught in every intro number theory class, but discovering it yourself? That's actually pretty cool. The "yay i reinvented smth" energy is both wholesome and hilarious—like Newton would've posted "just figured out why apples fall lol" on Discord. Props to Sylveon Sugar for the gentle reality check though. Sometimes the best discoveries are the ones that make you realize smart people 2,300 years ago already thought of everything.

Nothing says "career prospects in pure mathematics" quite like a McDonald's application waiting at the finish line. The conjecture states that TREE(n) is prime if and only if n is prime—which sounds innocent until you realize TREE(3) is so incomprehensibly massive it makes a googolplex look like pocket change. We're talking about a number so large that if you tried to write it out, the universe would experience heat death before you finished the first page. The monkey's unhinged grin perfectly captures the reaction of any mathematician who'd even attempt this proof. TREE(n) comes from graph theory and grows faster than pretty much any computable function you can name—it's in the realm of "busy beaver" territory where numbers become philosophical concepts rather than actual quantities. Proving this conjecture would require checking if these astronomical numbers are prime, which is... well, let's just say the McDonald's uniform is already being tailored. The brutal irony here is that solving one of the hardest mathematical problems imaginable nets you minimum wage. Welcome to academia, where groundbreaking discoveries in number theory qualify you to ask "would you like fries with that?"