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

Simple item page
dc.creatorEkhad, Shalosh B.
dc.creatorVatter, Vince
dc.creatorZeilberger, Doron
dc.date2005-09-15
dc.date.accessioned2026-07-07T05:23:14Z
dc.date.available2026-07-07T05:23:14Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/math/0509347
dc.identifierhttp://arxiv.org/abs/math/0509347
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/76356
dc.subjectCombinatorics
dc.titleA Proof of the Loehr-Warrington Amazing TEN to the Power n Conjecture
dc.typetext

Files

Collections

arXiv