Drexel dragonThe Math ForumDonate to the Math Forum

Search All of the Math Forum:

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

Math Forum » Discussions » Math Topics » discretemath

Topic: Edu59 Post
Replies: 1   Last Post: Oct 2, 2011 8:45 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Ben Brink

Posts: 198
From: Rosenberg, TX
Registered: 11/11/06
Edu59 Post
Posted: Oct 1, 2011 2:41 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply
att1.html (0.8 K)

Again assumng I understand the problem: Since the combinations are size 5, we're looking for the sum from i = 1 to i = 16 of
C(20-i-2,3). Hopefully this counts the combinations with 1, 4 and three other elements larger than 1 but not 4; 2, 5 and three other elements larger than 2 but not 5; etc. There can only be 16 summands since there are not three integers in K greater than 17 but not 20.
Again, I know some of you guys have combinatorial cannons compared to my peashooter! Please take something out of the drawer and help Edu59. Thanks.

Date Subject Author
Read Edu59 Post
Ben Brink
Read Re: Edu59 Post

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

[Privacy Policy] [Terms of Use]

© The Math Forum 1994-2015. All Rights Reserved.