TBPN
SpaceX S-1, Anthropic Revenue Booms, OpenAI Cracks Erdős Problem | Diet TBPN
And what's like the max number?
TBPN
SpaceX S-1, Anthropic Revenue Booms, OpenAI Cracks Erdős Problem | Diet TBPN
Like how do we basically organize those points such that we have the max number of them, right?
TBPN
SpaceX S-1, Anthropic Revenue Booms, OpenAI Cracks Erdős Problem | Diet TBPN
No, so you would think that, but I can basically explain why.
TBPN
SpaceX S-1, Anthropic Revenue Booms, OpenAI Cracks Erdős Problem | Diet TBPN
So let's kind of like formalize this better.
TBPN
SpaceX S-1, Anthropic Revenue Booms, OpenAI Cracks Erdős Problem | Diet TBPN
So we have u of n, right?
TBPN
SpaceX S-1, Anthropic Revenue Booms, OpenAI Cracks Erdős Problem | Diet TBPN
And this is basically the largest number of unit distance pairs among n points in the plane.
TBPN
SpaceX S-1, Anthropic Revenue Booms, OpenAI Cracks Erdős Problem | Diet TBPN
Okay, so basically like we're thinking about like, how do we solve this naively?
TBPN
SpaceX S-1, Anthropic Revenue Booms, OpenAI Cracks Erdős Problem | Diet TBPN
It's like, okay, what if we just take all the points?
TBPN
SpaceX S-1, Anthropic Revenue Booms, OpenAI Cracks Erdős Problem | Diet TBPN
We have n points and we just put them in a line and unit distance apart, right?
TBPN
SpaceX S-1, Anthropic Revenue Booms, OpenAI Cracks Erdős Problem | Diet TBPN
So it looks something like this.
TBPN
SpaceX S-1, Anthropic Revenue Booms, OpenAI Cracks Erdős Problem | Diet TBPN
Right, so for this example we have four points, but it doesn't matter, it's just n. So one, two, three, four, how many pairs are there?
TBPN
SpaceX S-1, Anthropic Revenue Booms, OpenAI Cracks Erdős Problem | Diet TBPN
There's three, right?
TBPN
SpaceX S-1, Anthropic Revenue Booms, OpenAI Cracks Erdős Problem | Diet TBPN
So basically this scales with n minus one.
TBPN
SpaceX S-1, Anthropic Revenue Booms, OpenAI Cracks Erdős Problem | Diet TBPN
So you would have a billion points, and there's nine, nine, nine, nine, whatever, n minus one.
TBPN
SpaceX S-1, Anthropic Revenue Booms, OpenAI Cracks Erdős Problem | Diet TBPN
Okay, so now if we put it in a grid, what happens?
TBPN
SpaceX S-1, Anthropic Revenue Booms, OpenAI Cracks Erdős Problem | Diet TBPN
So if we have a square grid here, there's nine points here, and then how many pairs are there?
TBPN
SpaceX S-1, Anthropic Revenue Booms, OpenAI Cracks Erdős Problem | Diet TBPN
I believe there's 12.
TBPN
SpaceX S-1, Anthropic Revenue Booms, OpenAI Cracks Erdős Problem | Diet TBPN
And basically as this number scales up,
TBPN
SpaceX S-1, Anthropic Revenue Booms, OpenAI Cracks Erdős Problem | Diet TBPN
It's still linear, so it's 2N.
TBPN
SpaceX S-1, Anthropic Revenue Booms, OpenAI Cracks Erdős Problem | Diet TBPN
Basically, if you do a billion points, it's two billion pairs.