We have started new website of Reference Notes where you will find Notes, Question Paper, Solution, Old is Gold, Educational Software of all level. The location is www.MeroSpark.com . We are transferring all content from here to our new site.

Permutation - Theorem -1 with Proof and Example | Mathematics Class 12

Mathematics | Notes Permutation Theorem - 1 Class : 12
Mathematics | Notes
Permutation Theorem - 1
Class : 12

Permutation is the arrangement of objects with respect to some order. The permutation on n objects taken r at a time is denoted by P(n, r) or nPr.

Theorem-1
The total no of permutation of a set of n objects taken r at a time is given by:
P(n, r) = n.(n – 1).(n – 2).(n – 3) ………….. (n – r + 1)
[OR]
P(n, r) = n!/(n – r)! [where : ! is sign for factorial]


Read this also:
Don't forget to LIKE, SHARE and COMMENT. Please Join with us on Facebook and Google+ for daily Notes and Updates.

No comments:

Post a Comment

Don't forget to Comment. If you want any Notes, Guides or Information Write on Comment Box.