# Inclusion-Exclusion Principle

*From*: "Little" <cookiecandyred@xxxxxxxxx>*Date*: 3 Dec 2005 10:19:03 -0800

Could someone explain to me how to use the Inclusion-Exclusion

Principle to solve this problem.

Question: A carousel has eight seats, each seat is distinct. Eight

girls are seated on the carousel facing forward ( each girl looks at

another girl's back). In how many ways can they change seats so that

each has a different girl in front of her? How can the problem change

when the seats are identical?

Thanks a lot for the help.

.

**Follow-Ups**:**Re: Inclusion-Exclusion Principle***From:*Proginoskes

- Prev by Date:
**Re: easiest and shortest proof of Jordan Curve theorem** - Next by Date:
**Re: Question about mathematical induction?** - Previous by thread:
**ring of endomorphisms of a module of finite length** - Next by thread:
**Re: Inclusion-Exclusion Principle** - Index(es):