KVICK SÖRT Quicksort is an efficient sorting algorithm based on a divide and conquer approach. Choosing the dividing element at random is a good strategy to avoid bad worst-case runtime.

Quicksort as IKEA-style instructions
idea-instructions.com/quick-sort/

At 17, Hannah Cairo Solved a Major Math Mystery | Quanta Magazine After finding the homeschooling life confining, the teen petitioned her way into a graduate class at Berkeley, where she ended up disproving a 40-year-old conjecture.

What a fantastic accomplishment -- and what a fantastic story! www.quantamagazine.org/at-17-hannah...

My thoughts on the crucial importance of methodology on self-reported AI performance on mathematics competitions, and my policy on commenting on such reports going forward: mathstodon.xyz/@tao/1148814...

Thank you; very nice lecture. I agree this is simpler to explain than Fib heaps.

LateXcalibur

Wanna see something cool?

At the Grammy's in 1976, Ella Fitzgerald and Mel Torme explained what jazz is.

The result? The crowd losing its mind. 🔥

I had an interesting experience yesterday, where my public-facing and scholarly worlds intersected, really collided. There were some fireworks.

Now I'm stuck in an airport on a layover, so I'm going to write about that experience. It happened at this talk at CSU Bakersfield #highered #academiclife

I'm teaching roughly this course starting today! I'll be happy to take a look at your material.

Um… triangle INEQUALITY?

Most interesting! What is the provenance of this proof?

Agreed. I assume when you review such a paper you give this feedback to the authors. Ever checked whether authors then follow through?

It's fun (not) to ask an LLM to prove this statement, patiently explain why its "proof" is wrong and ask for a new proof, iterating a few times.

Let W(n,d) = number of 2n-length walks on d-dim integer lattice starting from 0 that return to 0. Clearly W(n,1) = C(2n,n). Find a cute proof that W(n,2) = C(2n,n)^2. [h/t DeepC]

A wonderful talk (as is usual for Kasper).