# Fundamental Principles of Counting

## FUNDAMENTAL PRINCIPLES OF COUNTING

### (a) Multiplication Principle

There are m ways in doing a job and n ways of doing another job, then number of ways of doing both the jobs together is m × n.

Under the above situation, number of ways of doing either one job or the other
is m + n.

(ii) The number of ways of arranging n distinct objects in a row taking r(0 ≤ r ≤ n) at a time is nPr = n(n − 1)……(n − r + 1)

= which obviously means that

nP0 = 1, nP1 = n and nPn − 1 = nPn = n!

(iii) The number of ways of arranging n distinct objects along a circle is (n − 1)!.

(iv) The number of ways of arranging n beads along a circular wire = .

(v) The number of permutation of n things taken all at a time, p being alike of one kind, q of another kind, r of the third kind and the remaining n − (p + q + r) are all different is .

(vi) Number of ways of distributing 'n' distinct things among 'r' persons such that there is no restriction on number of things received by a person is rn.

(vii) The number of ways of selecting r(0 ≤ r ≤ n) objects out of n distinct objects is denoted by nCr = , if r > n then nCr = 0.

Note the following facts.

(a) nC0 = nCn = 1 (b) nCr = nCn − r

(c) nCr + nCr - 1 = n + 1Cr (d) nCx = nCy ⇔ x = y or x + y = n

(e) nCr = × n - 1Cr - 1 (f) (viii) The number of ways of selecting at least one object out of n distinct objects = 2n - 1.

(ix) The number of combination of r things (r ≤ n) out of n identical things is 1.

(x) The number of ways of selecting r objects from n objects = (r + 1), r = 0, 1, 2….. n.

(xi) The number of combinations of n distinct objects taking r at a time when k particular objects always occur is n - kCr - k. If k particular objects never occur then the number of combinations of n distinct objects taken r at a time is n - kCr.

(xii) If out of p + q + r + s things, p are alike of one kind, q alike of the other kind and r alike of the third kind and s are different then the total number of ways of selecting at least one thing is (p + 1) (q + 1) (r + 1)2s − 1.

(xiii) The number of factors of n = , where m1, m2, ….. mk are different primes is (α1 + 1) (α2 + 1) …. (αk + 1).
{"ft_lang_label":"__label__en","ft_lang_prob":0.8874655,"math_prob":0.99975425,"size":2219,"snap":"2023-40-2023-50","text_gpt3_token_len":675,"char_repetition_ratio":0.17968397,"word_repetition_ratio":0.08450704,"special_character_ratio":0.3204146,"punctuation_ratio":0.077731095,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.999746,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"im_url_duplicate_count":[null,2,null,2,null,2,null,2,null,2,null,2,null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-12-01T09:56:36Z\",\"WARC-Record-ID\":\"<urn:uuid:dfa53b1c-406e-4fd5-8731-1e5c0327aa0d>\",\"Content-Length\":\"180857\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d63b63e9-b222-4813-a1eb-7b7823135d89>\",\"WARC-Concurrent-To\":\"<urn:uuid:a33d7807-a737-4df0-baaf-f7d46f48a0a4>\",\"WARC-IP-Address\":\"108.138.85.95\",\"WARC-Target-URI\":\"https://www.pw.live/chapter-class11-mathematics-permutation-and-combinations\",\"WARC-Payload-Digest\":\"sha1:5IM62PPSWN53NTERME35QANTRCGVL3XI\",\"WARC-Block-Digest\":\"sha1:4MWKJHYFJ64H6A5OY2LVWXEBCCILEBON\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100286.10_warc_CC-MAIN-20231201084429-20231201114429-00640.warc.gz\"}"}