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

Pi 1.0
sergiotapia · Hacker News · 12h ago
Automatic Transmission – a data-privacy study of connected vehicles
rafaelc · Hacker News · 11h ago
Cops Can Bypass iPhone's Automatic Reboot to Get into Locked Phones
speckx · Hacker News · 17h ago
Singapore govt dating app uses Gale-Shapley stable marriage algorithm
rzk · Hacker News · 1d ago
Cloudflare K2: serverless event streams
elffjs · Hacker News · 17h ago