))
OEIS A000375: Topswops and the Quest for the Maximum Steps
Manage episode 510869226 series 3690682
Content provided by Mike Breault. All podcast content including episodes, graphics, and podcast descriptions are uploaded and provided directly by Mike Breault or their podcast platform partner. If you believe someone is using your copyrighted work without your permission, you can follow the process outlined here https://podcastplayer.com/legal.
We explore A000375, the maximum number of topswaps needed to bring the card 1 to the top in any n-card deck under Conway's Topswaps. We explain the simple rules, the termination proof via the Wilf number, and the sharp Fibonacci upper bound φ(n) ≤ F_{n+1} proved by Murray Klamkin. We also cover the Morales–Sudborough quadratic lower bound, the open gap between n^2 and F_{n+1} for n ≥ 20, and the intriguing non-termination of the Topdrops variant. Plus, we touch on computational questions and why this deceptively simple game continues to inspire deep mathematics.
Note: This podcast was AI-generated, and sometimes AI can make mistakes. Please double-check any critical information.
Sponsored by Embersilk LLC
1377 episodes
Share
