[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-1-en-105":3,"doc-seo-572714-105":53,"doc-detail-572714-en":126},{"code":4,"msg":5,"data":6},0,"success",[7,14,19,24,29,34,39,44,49],{"id":8,"doc_module":9,"doc_module_name":10,"category_name":11,"show_sort_weight":12,"slug":13},11,1,"Template","Presentations",90,"presentations",{"id":15,"doc_module":9,"doc_module_name":10,"category_name":16,"show_sort_weight":17,"slug":18},12,"Resumes",80,"resumes",{"id":20,"doc_module":9,"doc_module_name":10,"category_name":21,"show_sort_weight":22,"slug":23},14,"Invoices",70,"invoices",{"id":25,"doc_module":9,"doc_module_name":10,"category_name":26,"show_sort_weight":27,"slug":28},15,"Posters",60,"posters",{"id":30,"doc_module":9,"doc_module_name":10,"category_name":31,"show_sort_weight":32,"slug":33},16,"Social Media",50,"social-media",{"id":35,"doc_module":9,"doc_module_name":10,"category_name":36,"show_sort_weight":37,"slug":38},17,"Forms",40,"forms",{"id":40,"doc_module":9,"doc_module_name":10,"category_name":41,"show_sort_weight":42,"slug":43},18,"Letters",30,"letters",{"id":45,"doc_module":9,"doc_module_name":10,"category_name":46,"show_sort_weight":47,"slug":48},21,"Paper Templates",5,"papers-templates",{"id":50,"doc_module":9,"doc_module_name":10,"category_name":51,"show_sort_weight":4,"slug":52},158,"General","general-158",{"code":4,"msg":54,"data":55},"ok",{"site_id":56,"language":57,"slug":58,"title":59,"keywords":60,"description":61,"schema_data":62,"social_meta":119,"head_meta":121,"extra_data":123,"updated_unix":125},105,"en","chapter-1-combinatorics-basic-counting-principle-and-combinatorics","CHAPTER 1 - Combinatorics - Basic Counting Principle and Combinatorics","","Chapter 1 introduces core ideas in combinatorics: the basic counting principle, permutations, and combinations. It starts with counting strategies for sequential choices using multiplication, illustrated with examples on outfits and license plate numbers. It then explains permutations via factorials, covering arrangements with distinct items and repeats, including general formulas. Finally, it derives combination formulas (binomial coefficients), shows how to select committees, and extends to related identities and multinomial counting for partitioning sets.",{"@graph":63,"@context":118},[64,80,101],{"@type":65,"itemListElement":66},"BreadcrumbList",[67,71,74,77],{"item":68,"name":69,"@type":70,"position":9},"https://docshare.wps.com","Home","ListItem",{"item":72,"name":10,"@type":70,"position":73},"https://docshare.wps.com/template/",2,{"item":75,"name":46,"@type":70,"position":76},"https://docshare.wps.com/template/paper-templates/",3,{"item":78,"name":59,"@type":70,"position":79},"https://docshare.wps.com/template/chapter-1-combinatorics-basic-counting-principle-and-combinatorics/572714/",4,{"url":78,"name":59,"@type":81,"image":82,"author":87,"headline":59,"publisher":90,"fileFormat":93,"inLanguage":57,"description":61,"dateModified":94,"datePublished":95,"encodingFormat":93,"isAccessibleForFree":96,"interactionStatistic":97},"DigitalDocument",{"url":83,"@type":84,"width":85,"height":86},"https://docshare.wps.com/thumbnails/chapter-1-combinatorics-basic-counting-principle-and-combinatorics/572714.png","ImageObject",442,249,{"name":88,"@type":89},"Taylor Morgan","Person",{"url":68,"name":91,"@type":92},"DocShare","Organization","application/pdf","2026-10-15","2026-10-13",true,{"@type":98,"interactionType":99,"userInteractionCount":9},"InteractionCounter",{"@type":100},"ViewAction",{"@type":102,"mainEntity":103},"FAQPage",[104,110,114],{"name":105,"@type":106,"acceptedAnswer":107},"What does the basic counting principle say in this chapter?","Question",{"text":108,"@type":109},"When one task has n possible outcomes and another task has m possible outcomes, the total number of outcomes for performing both actions is m × n.","Answer",{"name":111,"@type":106,"acceptedAnswer":112},"How are permutations counted?",{"text":113,"@type":109},"For n distinct objects, the number of permutations is n!, based on arranging choices position by position.",{"name":115,"@type":106,"acceptedAnswer":116},"How are combinations (binomial coefficients) counted when order does not matter?",{"text":117,"@type":109},"The number of ways to choose k objects from n is given by C(n, k) = n! / (k!(n-k)!), since orderings of the chosen set are disregarded.","https://schema.org",{"og:url":78,"og:type":120,"og:title":59,"og:site_name":91,"og:description":61},"article",{"robots":122,"canonical":78},"index,follow",{"doc_id":124,"site_id":56},572714,1792061786,{"code":4,"msg":5,"data":127},{"doc_id":124,"user_id":128,"nickname":88,"user_avatar":129,"doc_module":9,"category_id":45,"category_name":46,"doc_title":59,"doc_description":61,"doc_content":130,"file_id":131,"file_url":132,"file_type":133,"file_size":134,"view_count":9,"is_deleted":4,"is_public":9,"is_downloadable":9,"audit_status":9,"page_count":40,"language":135,"language_code":57,"site_id":56,"html_lang":57,"table_of_contents":136,"faqs":137,"seo_title":138,"seo_description":61,"update_tm":139,"read_time":140},1099523885336,"https://ap-avatar.wpscdn.com/davatar_276721f389ce27ea32af1340a28f341c","CHAPTER 1  \nCombinatorics  \n1.1. Basic counting principle and combinatorics  \n1.1.1. Basic counting principle. The ✜rst basic counting principle is to multiply. Namely, if there are n possible outcomes of doing something and m outcomes of doing another thing, then there are m 􀀁 n possible outcomes of performing both actions.  \nBasic counting principle  \nSuppose that two experiments are to be performed. Then if experiment 1 can result in any one of m possible outcomes, and if for each outcome of experiment 1 there aren possible outcomes of experiment 2, then there are m 􀀁 n possible outcomes of the two experiments together.  \nExample 1.1 . Suppose we have 4 shirts of 4 di✛erent colors and 3 pants of di✛erent colors. How many di✛erent out✜ts are there? For each shirt there are 3 di✛erent colors of pants, so altogether there are 4 􀀂 3 = 12 possibilities.  \nExample 1.2 . How many di✛erent license plate numbers with 3 letters followed by 3 numbers are possible?  \nSolution: (26)3 (10)3 . Indeed, the English alphabet has 26 di✛erent letters, therefore there are 26 possibilities for the ✜rst place, 26 for the second, 26 for the third, 10 for the fourth, 10 for the ✜fth, and 10 for the sixth. We multiply.  \n1.1.2. Permutations. How many ways can one arrange letters a; b; c? We can list all possibilities, namely,  \nabc acb bac bca cab cba:  \nThere are 3 possibilities for the ✜rst position. Once we have chosen the letter in the ✜rst position, there are 2 possibilities for the second position, and once we have chosen the ✜rst two letters, there is only 1 choice left for the third. So there are 3 􀀂 2 􀀂 1 = 6 = 3! arrangements. In general, if there are n distinct letters, there are n! di✛erent arrangements of these letters.  \nExample 1.3 . What is the number of possible batting orders (in baseball) with 9 players?  \n➞ Copyright 2013 Richard F. Bass, 2020 Masha Gordina Typesetting date: March 31, 2020  \n4 1. COMBINATORICS Solution: 9! = 362880 .  \nExample 1.4 . How many ways can one arrange 4 math books, 3 chemistry books, 2 physics books, and 1 biology book on a bookshelf so that all the math books are together, all the chemistry books are together, and all the physics books are together?  \nSolution: 4! 􀀁 (4! 􀀁 3! 􀀁 2! 􀀁 1!) = 6912 . We can arrange the math books in 4! ways, the chemistry books in 3! ways, the physics books in 2! ways, and the biology book in 1! = 1 way. But we also have to decide which set of books go on the left, which next, and so on. That is the same as the number of ways of arranging of four objects (such as the letters M; C; P; B), and there are 4! ways of doing that.  \nIn permutations the order does matter as is illustrated by the next example.  \nExample 1.5 . How many ways can one arrange the letters a; a; b; c? Let us label them ✜rst as A; a; b; c. There are 4! = 24 ways to arrange these letters. But we have repeats: we could have Aa or aA which are the same. So we have a repeat for each possibility, and so the answer should be 4!=2! = 12 .  \nIf there were 3 as, 4 bs, and 2 cs, we would have  \n3!94!!2! = 1260 :  \nWhat we just did is called ✜nding the number of permutations. These are permutations of a given set of objects (elements) unlike the example with the licence plate numbers where we could choose the same letter as many times as we wished.  \nPermutations  \nThe number of permutations of n objects is equal to  \nn! := 1 􀀁 ::: 􀀁 n;  \nwith the usual convention 0! = 1 .  \n1.1.3. Combinations. Now let us look at what are known as combinations.  \nExample 1.6 . How many ways can we choose 3 letters out of 5? If the letters are a; b; c; d; e and order matters, then there would be 5 choices for the ✜rst position, 4 for the second, and 3 for the third, for a total of 5 􀀂 4 􀀂 3. Suppose now the letters selected were a; b; c. If order does not matter, in our counting we will have the letters a; b; c six times, because there are 3! ways of arranging three letters. The same is true for any choice of three letters. So we sho","cbCaic2akiiuquaV","https://ap.wps.com/l/cbCaic2akiiuquaV","pdf",346008,"English","# CHAPTER 1\n## Basic counting principle and combinatorics\n## Permutations\n## Combinations (binomial coefficients)\n## Combinations (multinomial coefficients)","[{\"question\":\"What does the basic counting principle say in this chapter?\",\"answer\":\"When one task has n possible outcomes and another task has m possible outcomes, the total number of outcomes for performing both actions is m × n.\"},{\"question\":\"How are permutations counted?\",\"answer\":\"For n distinct objects, the number of permutations is n!, based on arranging choices position by position.\"},{\"question\":\"How are combinations (binomial coefficients) counted when order does not matter?\",\"answer\":\"The number of ways to choose k objects from n is given by C(n, k) = n! / (k!(n-k)!), since orderings of the chosen set are disregarded.\"}]","CHAPTER 1 - Combinatorics - Basic Counting Principle and Combinatorics | PDF",1791928978,6]