Automatic Solution of Richard Stanley's Amer. Math. Monthly Problem #11610 and ANY Problem of That Type

Details Automatic Solution of Richard Stanley's Amer. Math. Monthly Problem #11610 and ANY Problem of That Type Automatic Solution of Richard Stanley's Amer. Math. Monthly Problem #11610 and ANY Problem of That Type

2011-12-29

arxiv.org/abs/1112.6207v1

Mathematics

Combinatorics

Accompanied by Maple package <A HREF="http://www.math.rutgers.edu/~zeilberg/tokhniot/RPS">RPS</A> . Sample input and output

Scientific paper

Richard Stanely proposed, in a recent Amer. Math. Monthly Problem, to prove a
nice explicit formula for the generating function for the number of n-letter
words in {H,T} that have as many occurrences of HT as HH. In this article, we
show how to prove this problem automatically, and ANY problem of that type,
regardless of the size of the alphabet and the length of the two chosen strings

Affiliated with

Also associated with

No associations

Rating

Automatic Solution of Richard Stanley's Amer. Math. Monthly Problem #11610 and ANY Problem of That Type 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 Automatic Solution of Richard Stanley's Amer. Math. Monthly Problem #11610 and ANY Problem of That Type, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Automatic Solution of Richard Stanley's Amer. Math. Monthly Problem #11610 and ANY Problem of That Type will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-728246