Permutations and Derangements

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
397 views
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Sep 22, 2009

This video asks a question in simple combinatorics and works towards the answer, deriving a recursion relation for the number of ways to order n soldiers, when none is allowed to go in their correct position. The recursion relation is

D(n) = (n-1)(D(n-1) + D(n-2))

To explore this problem beyond the simple recursion relation, see my related blog post:
http://arcsecond.wordpress.com/2009/09/22/the-deranged-rockettes/

Category:

Education

Tags:

License:

Standard YouTube License

  • likes, 1 dislikes

Link to this comment:

Share to:
see all

All Comments (1)

Sign In or Sign Up now to post a comment!
  • nice, i think you're missing some brackets though

Loading...

Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more