A Proof of the Loehr-Warrington Amazing TEN to the Power n Conjecture
Abstract
We prove, via 30 seconds of Maple computation, that there are 10n words in the alphabet 3,-2 of length 5n, sum 0, and such that every factor that sums to 0 and that starts with a 3 may not be immediately followed by a -2.
0
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.