The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » Math Topics » discretemath

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Question on Hamilton
Replies: 0  

Advanced Search

Back to Topic List Back to Topic List  
Ben Brink

Posts: 201
From: Rosenberg, TX
Registered: 11/11/06
Question on Hamilton
Posted: Aug 20, 2009 9:41 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply
att1.html (1.1 K)

To prove the formula just before Section 378 on p. 364 in Lectures in Quaternions, I need:

(1) for 1<=k<=n-m, the number of associative decompositions of k + m pairwise noncommuting factors into products of m+1 expressions is (1/m!)k(k+1)...(k+m-1); (2) Sum(from k = 1 to k = n-m) of [(1/m!)k(k+1)...(k+m-1)][(n+1)-(k+m)] =[(n+1)n...(n-m)]/(m+2)!

If anyone has a correction or reference in a website/text/handbook (e.g. Henry Gould's Combinatorial Identities), I would much appreciate it.

Thanks for everybody's time!


Windows Live: Keep your friends up to date with what you do online.

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.