All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Events (Posted on 2005-02-10)
Suppose there were three events that could be done in any order. Let these events be A, B and C. There are a total of 6 possible ways the events can be performed.

However, this time, there is a restriction. B can only be performed after A. In other words, A must be performed before B can, and ACB is also accepted.

Your task is to find a general formula for X number of events, and Y number of restrictions.

None of the events is mentioned in more than one restriction.

 No Solution Yet Submitted by wcaexqdz Rating: 2.0000 (4 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
 define restriction | Comment 3 of 4 |

The problem addresses only restricions of "A before B" type.
However other restricions exist; e.g. "A and B are neighbors",
"A is neither first or last ","A and B are  never neighbors", etc

As opposed to the first type restriction (halving the number of admissible permutations) these  cause other results  and therefore should be evaluated each according to its definition.

 Posted by Ady TZIDON on 2005-02-10 16:39:23
Please log in:
 Login: Password: Remember me: Sign up! | Forgot password

 Search: Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (4)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information