Earlier quoted context omitted.
I actually don't think the reason is that they are easier than other open math problems. I think it's more that they are "elementary" in the sense that the problems usually don't require a huge amount of domain knowledge to state.
The Collatz conjecture can be stated using basic arithmetic, yet LLMs have not been able to solve it.
Erdos 281 solved with ChatGPT 5.2 Pro
161–170 of 310 posts
Re: Erdos 281 solved with ChatGPT 5.2 Pro
#162I’m not sure what this proves. I dumped a question into ChatGPT 5.2 and it produced a correct response after almost an hour [2]?
Okay? Is it repeatable? Why did it come up with this solution? How did it come up with the connections in its reasoning? I get that it looks correct and Tao’s approval definitely lends credibility that it is a valid solution, but what exactly is it that we’ve established here? That the corpus that ChatGPT 5.2 was trained on is better tuned for pure math?
I’m just confused what one is supposed to take away from this.
[1] https://news.ycombinator.com/item?id=46560445
[2] https://chatgpt.com/share/696ac45b-70d8-8003-9ca4-320151e081...
Re: Erdos 281 solved with ChatGPT 5.2 Pro
#163A surprising % of these LLM proofs are coming from amateurs. One wonders if some professional mathematicians are instead choosing to publish LLM proofs without attribution for career purposes.
It's probably from the perennial observation "This LLM is kinda dumb in the thing I'm an expert in"
Re: Erdos 281 solved with ChatGPT 5.2 Pro
#164FWIW, I just gave Deepseek the same prompt and it solved it too (much faster than the 41m of ChatGPT). I then gave both proofs to Opus and it confirmed their equivalence. The answer is yes. Assume, for the sake of contradiction, that there exists an \(\epsilon > 0\) such that for every \(k\), there exists a choice of congruence classes \(a_1^{(k)}, \dots, a_k^{(k)}\) for which the set of integers not covered by the f…
"Since \(U_{k+1} \subseteq U_k\), the sets \(U_k\) are decreasing and periodic, and their intersection \(U = \bigcap_{k \ge 1} U_k\) has density \(d = \lim_{k \to \infty} d_k \ge \epsilon\)." Is this enough? Let $U_k$ be the set of integers such that their remainder mod 6^n is greater or equal to 2^n for all 1<n<k. Density of each $U_k$ is more than 1/2 I think but not the intersection (empty) right?
This would all be a fairly trivial exercise in diagonalization if such a lemma as implied by Deepseek existed.
(Edit: The bounding I suggested may not be precise at each level, but it is asymptotically the limit of the sequence of densities, so up to some epsilon it demonstrates the desired counterexample.)
Re: Erdos 281 solved with ChatGPT 5.2 Pro
#165Re: Erdos 281 solved with ChatGPT 5.2 Pro
#166I have 15 years of software engineering experience across some top companies. I truly believe that ai will far surpass human beings at coding, and more broadly logic work. We are very close
> I have 15 years of software engineering experience across some top companies. I truly believe that ai will far surpass human beings at coding, and more broadly logic work. We are very close Coding was never the hard part of software development.
Re: Erdos 281 solved with ChatGPT 5.2 Pro
#167Re: Erdos 281 solved with ChatGPT 5.2 Pro
#168Re: Erdos 281 solved with ChatGPT 5.2 Pro
#169Earlier quoted context omitted.
This illustrates how unimportant this problem is. A prior solution did exist, but apparently nobody knew because people didn't really care about it. If progress can be had by simply searching for old solutions in the literature, then that's good evidence the supposed progress is imaginary. And this is not the first time this has happened with an Erdős problem. A lot of pure mathematics seems to consist in solving nea…
It shows that a 'llm' can now work on issues like this today and tomorrow it can do even more. Don't be so ignorant. A few years ago NO ONE could have come up with something so generic as an LLM which will help you to solve this kind of problems and also create text adventures and java code.
Re: Erdos 281 solved with ChatGPT 5.2 Pro
#170Earlier quoted context omitted.
You’re confusing immediately useful with eventually useful. Pure maths has found very practical applications over the millennia - unless you don’t consider it pure anymore, at which point you’re just moving goalposts.
No, I'm not confusing that. Read the linked comment if you're interested.
Among others.
Of course you never know which math concept will turn out to be physically useful, but clearly enough do that it's worth buying conceptual lottery tickets with the rest.