Expired50% confidenceFactExact time
Erdős conjectured that the upper bound of U(N) is N^(1+o(1)), where o(1) tends to 0 as N grows.
1
Sources
50%
Confidence
Medium-term (~90 days)
Relevance
7/2/2026
First Seen
Valid until: 9/30/2026(expired)
Sources
OpenAI Cracks Erdős Unit Distance Conjecture: AI Independently Disproves 80-Year-Old Math Problem for the First Time
bilibiliAI技术投降派6/6/2026
Related Claims
Unverified第 n 个折痕的方向由整数 n 的二进制表示唯一确定：将 n 除以 2 直到得到奇数，若结果模 4 余 1 则折痕向右，余 3 则向左60% similarUnverifiedA graph with n vertices has 2^(n(n-1)/2) possible configurations60% similarUnverifiedErdős单位距离问题（Unit Distance Problem）问的是在平面上放置n个点，最多能有多少对点之间的距离恰好为159% similarUnverified欧拉公式 e^(iθ) = cos(θ) + i·sin(θ) 揭示了正弦波与复指数函数之间的联系56% similarUnverifiedThe Johnson-Lindenstrauss lemma guarantees that for any ε∈(0,1), as long as the target dimension k≥O(log(n)/ε²), there exists a mapping from high dimensions to k dimensions that preserves all pairwise distances within a factor of (1±ε).55% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/50583API
curl https://kongchang.com/api/v1/knowledge/claims/50583MCP
get_claim(id=50583)