AI破解埃尔德什数学难题引发争议

Think about placing dots on a flat surface. You want as many pairs as possible to be separated by the same distance. For any amount of dots, what’s the greatest possible number of pairs that can be exactly that far apart? The question, called the unit distance problem, seems simple. The answer is tricky. Eighty years ago, mathematician Paul Erdős proposed what he thought was the answer, but no one had been able to prove or disprove his conjecture. At least, not until now. Researchers at OpenAI fed the conjecture to an AI model and walked away. When they returned, they discovered the model had dis- proved it. …