A Proof of the Loehr-Warrington Amazing TEN to the Power n Conjecture

Vince Vatter, Doron Zeilberger, Shalosh B. XIV Ekhad

Publication date: 15 September 2005

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 page was built for publication: A Proof of the Loehr-Warrington Amazing TEN to the Power n Conjecture