A Proof of the Loehr-Warrington Amazing TEN to the Power n Conjecture
classification
🧮 math.CO
keywords
alphabetamazingcomputationconjectureeveryfactorfollowedimmediately
read the original abstract
We prove, via 30 seconds of Maple computation, that there are 10^n 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.