註冊並分享邀請連結,可獲得影片播放與邀請獎勵。

Conjectures.io
@conjectures_io
(Bittensor Subnet 66) rewards anyone who can solve open mathematical problems and advance the frontier of mathematics.
加入 February 2025
22 正在關注    1.3K 粉絲
Today, we’re announcing a solution found by our miners to Erdős Problem 96, open for over 66 years. The result disproves the conjectured linear bound, constructing strictly convex polygons with superlinearly many unit-distance pairs. Verified in Lean through Conjectures. Full proof below.
顯示更多
0
9
123
34
轉發到社區