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

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

2005-09-15

arxiv.org/abs/math/0509347v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Proof of the Loehr-Warrington Amazing TEN to the Power n Conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Proof of the Loehr-Warrington Amazing TEN to the Power n Conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Proof of the Loehr-Warrington Amazing TEN to the Power n Conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-407443