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: The Sieve Formula
Replies: 0  

Advanced Search

Back to Topic List Back to Topic List  
slackin-jer

Posts: 1
Registered: 12/2/08
The Sieve Formula
Posted: Dec 2, 2008 1:24 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

I have a problem that I am working on that I am having a lot of trouble with, perhaps you guys can help me out.

In how many ways can we list the digits {1,1,1,2,2,3,4,5} so that two identical digits are not in consecutive positions?



Also, one other problem dealing with the same topic:

How many partitions of [8] satisfy the three following properties.
1.) 1 and 2 are in different parts,
2.) 2 and 3 are in different parts, and
3.) 7 and 8 are in different parts.
Recall that the n-th Bell number counts the number of set partitions of [n]. The first few terms of B(n) are listed below:

{B(n)}n>=1 = {1,2,5,15,52,203,877,4140,...}


Thanks a lot for the help guys, I really appreciate it.



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

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.