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…
After an AI from OpenAI found a trick to solve an 80-year-old conjecture from Paul Erdős, mathematicians have borrowed the same technique to solve another important problem
Take a group of runners circling a track at unique, constant paces. Answering the question of how many will always end up running alone, no matter their speed, has vexed mathematicians for decades.
