A digestion of the proof of Sendov's conjecture

·Hacker News··

This post concerns the following conjecture of Sendov, as well as its strengthening by Phelps–Rodriguez: Conjecture 1 (Sendov’s conjecture) Let $latex {n \geq 2}&fg=000000$, and let…

Read full article →

Related Articles

Qwen3.8 27B scores 52 on Artificial Analysis
anana_ · Hacker News · 10h ago
India has paved the way for charging merchants a fee on UPI transactions
monkey_monkey · Hacker News · 8h ago
AI-Generated GitHub Copilot “Autofix” Allowed Compromise of Snowflake's Jira
galnagli · Hacker News · 13h ago
A Preview of DuckDB v2.0
ibotty · Hacker News · 13h ago
Self hosted email continues to steeply decline
minusf · Hacker News · 16h ago