A permutation is an arrangement in which order is important. The notation for
permutations is P(n,r) which is the number of permutations of "n" things if only "r"
are selected.
Example: If nine students take a test and all have different scores, the highest
score could be achieved by any of the nine students. The second highest score could
be achieved by one of the remaining 8 students. The third highest score could be
achieved by one of the 7 remaining students.
The number of possible permutations would be: P(9,3) = 9*8*7 = 504 possible arrangements
of the top three scores.
Notice: AAAMath licensed software. This
file and associated files are copyrighted software that is protected under United
States and international copyright laws and agreements. It is a violation of the
law to distribute or duplicate this software. This includes distribution outside
of the specific physical household, classroom, or school location for which the
license was purchased. Violators will be prosecuted to the full extent of
the law. If you notice a violation please contact AAAMath at
copyright@aaamath.com