Sign in or 

| n!= n x (n-1) x (n-2) x (n-3)...3 x 2 x 1 |

ewakabat14 |
Latest page update: made by ewakabat14
, Jun 9 2007, 12:57 PM EDT
(about this update
About This Update
Edited by ewakabat14
16 words added 47 words deleted view changes - complete history) |
|
Keyword tags:
Distinct Permutations
Factorials
MCP
Permutations
More Info: links to this page
|
| Started By | Thread Subject | Replies | Last Post | ||
|---|---|---|---|---|---|
| Anonymous | hey | 0 | Jul 7 2009, 7:11 PM EDT by Anonymous | ||
|
|
Thread started: Jul 7 2009, 7:11 PM EDT
Watch
an octagon have 8 sides, how many diagonals does an octagon have?
|
||||
| Anonymous | math homework | 1 | Apr 28 2009, 10:50 PM EDT by Mr._D'Onofrio | ||
|
|
Thread started: Apr 28 2009, 6:51 PM EDT
Watch
Ok im doing math homework and i have to right about how permutations and factorialsare the same or alike! Do you think anyone can help i dont get it? Help me think of some ideas!!!! Pleassssse
|
||||
| r_potter | Stuck | 2 | Feb 18 2009, 8:50 PM EST by Anonymous | ||
|
Thread started: Feb 4 2009, 11:14 PM EST
Watch
Hi, I'm doing the same work in my class, but I'm stuck on how one of the questions:
How many ways can you pick a president, vice-president, and secretary from a group of six boys and five girls if: b) there must be at least one boy chosen? and c) there must be only one girl chosen? I already have the answers here, but I do not understand the steps I must take to get to the answer. If you could help me, that would be appreciated! |
|||||