Visualizing the Sum-Product Conjecture
Abstract
Let SPP(n) be the set \(|A+A|,|A A|) : A⊂eq N, |A|=n\ of sum-product pairs, where A+A is the sumset \a+b : a,b∈ A\ and A A is the product set \ab:a,b∈ A\. We construct a dataset consisting of 1162868 sets whose sum-product pairs are at least 84\% of SPP(n) for each n 32. Notably, we do **not** see evidence in favor of Erdos's Sum-Product Conjecture in our dataset. For n 6, we prove the exact value of SPP(n). We include a number of conjectures, open problems, and observations motivated by this dataset, a large number of color visualizations.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.