Jordan Schneider
speaker
408 appearances
2 recordings
2 series
first heard Oct 2025
last heard 21 May
Jordan Schneider’s voice in public audio — every appearance, attributed to the second.
Trend
recordings per month · last 12 monthsRecordings per month over the last 12 months — 2 in all, peaking in May 2026 with 1.
Appearances
So this scales at n to the 1 plus O, 1 over log log n, right?
This is basically the best kind of example that we know works.
So we know we can find this, but is this the upper bound?
We don't know.
Okay.
So this is basically the lower bound.
Okay.
So then the question is like,
We have the lower bound, which is the best one we found.
This is the most number of pairs.
And then we theorized that the high bound, upper bound, scales with n to the 4 3rds.
And then so Erdos, the original conjecture that he thought that the upper bound is still gonna be less than N to the one plus O of one.
So this means O of one, it's like as it scales, as N scales to infinity, right?
So O of one basically scales to zero.
It go to zero as N goes to infinity.
And then basically OpenAI figured out that this is not true and that there actually are some
there are some n's for which this kind of max number of pairs is greater than the original Erdos conjecture.
So for infinitely many n, this is not for every single n, so it's not like five points or whatever, but there are infinitely many n's for which this is true, that it scales with, that it's greater than n to the one plus some constant.
Okay, so that was basically the big thing, right?
This is like, you know... Huge if you're into math.
Showing 61–80 of 408 · page 4 of 21
← Previous
Next →