Tyler Cosgrove

I believe it's Erdos.

I can basically go through a simple explanation of what the problem actually is.

Just for some context, Paul Erdos, this legendary mathematician, throughout the 20th century, he basically proposes, I think the number is a little over 1,200 different little problems.

These are the Erdos problems.

People talk a lot about these as like goals for AI to solve.

And you've heard like over time, there's been kind of like small iterative kind of solutions to a lot of these problems.

Yeah.

There's like a main kind of place where all of the solutions go.

So sometimes people will find, like AI will like find a different paper that wasn't actually put on the website and then they're like, oh, AI solved it.

But it's honestly true.

But this is kind of the first time we've really seen kind of a big step change.

Like this is actually a new solution.

This is using like, you know, kind of novel ideas here.

Yeah.

So this was problem number 90.

So I can kind of read the question, then I can explain what it means.

So it's, does every set of n distinct points in the real plane contain at most n to the one plus O of one over log log n many pairs which are one apart?

Okay, so like, what does that mean?

Basically, we have like the real plane, right, 2D, and we have a bunch of points on it.

What is basically, how many like pairs of those will be basically one unit apart?