The document discusses permutations and combinations. Some key points:
1. A permutation is an ordered arrangement of objects. The number of permutations of n objects taken r at a time is written as P(n,r) or nPr.
2. A combination is an unordered selection of objects. The number of combinations of n objects taken r at a time is written as C(n,r) or nCr.
3. Examples are provided to illustrate calculating permutations and combinations in different scenarios like selecting committees, poker hands, and routes on a grid.
Masasabi ba natin na tamad talaga ang mga Pilipino? Saan kaya nagsimula ang ganitong katamaran ng mga Pilipino?
NOTES:
https://www.scribd.com/document/341656611/Katamaran-Ng-Filipino-NOTES
Proyekto sa FIL4: Panitikan ng Rehiyon
Halaw sa librong "Literatura ng Iba't-Ibang Rehiyon ng Pilipinas" (2001) ni Carmelita S. Lorenzo, et. al.
Presentasyon ni Kyla Barcelona
BSED IIB - FILIPINO
BUOD
Ang kwentong ito ay umiikot kay fely, isang babaeng nakipagsapalaran sa ibang bansa at nagtagumpay sa buhay. Bumalik si fely sa ilipinasupang dumalo sa isang panauhing paandangal or guest sa dati niyang skwelahan. Unang dating palang sa kanilang nayon ay hindi na siya makilala ng mga kanayon niya at ng mga nadadaanan niya at tanging naririg lamang niya ay “ARTISTA!, ARTISTA NGA BA?, ARTISTA” sabi ng mga kanayon niya. Nandahil narin ito sa agbabagong pisikal lalo na sa kanyang pananamit, Ni mga kamag anak niya ay hindi din siya makilala. Pagdating na pagdating niya sa bahay nila ay unag nakita niya Nana Ibang na siyang nag-aruga sakanilang magkakapatid. Ang nasabi lamang ng kanyang nana ibang ay marami na ang nagbago. Ngunit tuloy pain ang pagtatanong ni Fely kung bakit halos hindi na siya nakikilala ng mga kanayon niya na umuuwi naman siya ng dalawang besis sa Isang taon, sa araw ng pasko at araw ng patay. Umuwi siya ng ilipinas dahil naimbitahan siya ni duardo, ang lalaking matalik niyang kaibigan at nagpatibok ng kanyang puso at dahil narin sa kanyang pamilya, sa kanyang pagbabalik ay umasa siyang pwedi pa subalit habang nakasakay sila sa kotse ay sinabi nalang bigla ni duardo na “Sayang hindi ka nakitaa ni monang”, fely:”monang?”, duardo: kaklase natinsa ika-4 na grado bago lang isinilang ang pang-anim na anak naming”. Ang tanging nasabi lamang ni Fely ay Conratulation! Sabay tingin sa bintana na pinamamasadan at inilalarawan niya ang mga bago sa kanilang skwelahan at sa mga taong dumudungaw sa bintana niya, na gusto siyang Makita na para bang subrang taas niya o artista ang turing sakanya, pagbaba niya ng kotse ay lahat ng tao ay nakatingin sakanya na para bang hndi siya kilala na tingin na sakanya ay isang banyaga na galing pa sa ibang bansa.
Masasabi ba natin na tamad talaga ang mga Pilipino? Saan kaya nagsimula ang ganitong katamaran ng mga Pilipino?
NOTES:
https://www.scribd.com/document/341656611/Katamaran-Ng-Filipino-NOTES
Proyekto sa FIL4: Panitikan ng Rehiyon
Halaw sa librong "Literatura ng Iba't-Ibang Rehiyon ng Pilipinas" (2001) ni Carmelita S. Lorenzo, et. al.
Presentasyon ni Kyla Barcelona
BSED IIB - FILIPINO
BUOD
Ang kwentong ito ay umiikot kay fely, isang babaeng nakipagsapalaran sa ibang bansa at nagtagumpay sa buhay. Bumalik si fely sa ilipinasupang dumalo sa isang panauhing paandangal or guest sa dati niyang skwelahan. Unang dating palang sa kanilang nayon ay hindi na siya makilala ng mga kanayon niya at ng mga nadadaanan niya at tanging naririg lamang niya ay “ARTISTA!, ARTISTA NGA BA?, ARTISTA” sabi ng mga kanayon niya. Nandahil narin ito sa agbabagong pisikal lalo na sa kanyang pananamit, Ni mga kamag anak niya ay hindi din siya makilala. Pagdating na pagdating niya sa bahay nila ay unag nakita niya Nana Ibang na siyang nag-aruga sakanilang magkakapatid. Ang nasabi lamang ng kanyang nana ibang ay marami na ang nagbago. Ngunit tuloy pain ang pagtatanong ni Fely kung bakit halos hindi na siya nakikilala ng mga kanayon niya na umuuwi naman siya ng dalawang besis sa Isang taon, sa araw ng pasko at araw ng patay. Umuwi siya ng ilipinas dahil naimbitahan siya ni duardo, ang lalaking matalik niyang kaibigan at nagpatibok ng kanyang puso at dahil narin sa kanyang pamilya, sa kanyang pagbabalik ay umasa siyang pwedi pa subalit habang nakasakay sila sa kotse ay sinabi nalang bigla ni duardo na “Sayang hindi ka nakitaa ni monang”, fely:”monang?”, duardo: kaklase natinsa ika-4 na grado bago lang isinilang ang pang-anim na anak naming”. Ang tanging nasabi lamang ni Fely ay Conratulation! Sabay tingin sa bintana na pinamamasadan at inilalarawan niya ang mga bago sa kanilang skwelahan at sa mga taong dumudungaw sa bintana niya, na gusto siyang Makita na para bang subrang taas niya o artista ang turing sakanya, pagbaba niya ng kotse ay lahat ng tao ay nakatingin sakanya na para bang hndi siya kilala na tingin na sakanya ay isang banyaga na galing pa sa ibang bansa.
An idea about the Permutation and Combination with a multitude of examples to clarify the concepts . Mainly concepts and their applicability in Business Stats. 20 Good examples including dice and card problems.
Lecture #2 for course CS301: "Algorithmic Combinatorics I" for 3rd year students with a computer science major, Faculty of Science, Ain Shams University, Academic Year WS2014/2015.
A short presentation to explain the use of permutations and combinations and some examples to illustrate the concepts. This was made as an assignment in which i was to explain the concepts to the class.
APEX INSTITUTE was conceptualized in May 2008, keeping in view the dreams of young students by the vision & toil of Er. Shahid Iqbal. We had a very humble beginning as an institute for IIT-JEE / Medical, with a vision to provide an ideal launch pad for serious JEE students . We actually started to make a difference in the way students think and approach problems. We started to develop ways to enhance students IQ. We started to leave an indelible mark on the students who have undergone APEX training. That is why APEX INSTITUTE is very well known of its quality of education
PRINCIPLES OF COUNTING AND THEORIES OF PROBABILITY.pptxtmccfrancisquarre
This presentation discusses the topic about the fundamental counting principle and its method of illustrating the outcomes using tabular form, systematic listing, tree diagram, and using FCP. This further shows the four rules under permutation. Linear Permutation, Distinguishable Permutation, Permutation of Distinct Objects, and Circular Permutation.
Internet of Things (IoT) two-factor authentication using blockchainDavid Wood
Presented at the Ethereum Engineering Group Meetup in Brisbane, Australia, on 13 Nov 2019. We report on research to use an Ethereum blockchain as an MFA and/or MPA device to secure command channels on IoT networks, even when the underlying network may be compromised.
Methods for Securing Spacecraft Tasking and Control via an Enterprise Ethereu...David Wood
Presentation at ICSSC 2019 (see http://www.kaconf.org) associated with the following academic paper:
David Hyland-Wood, Peter Robinson, Roberto Saltini, Sandra Johnson, Christopher Hare. Method for Securing Spacecraft Tasking and Control via an Enterprise Ethereum Blockchain. Proc. 37th International Communications Satellite Systems Conference (ICSSC), 29 October - 1 November 2019.
Implementing the Verifiable Claims data modelDavid Wood
The W3C Verifiable Claims data model arguably requires a decentralised, distributed database controllable by three types of parties; issuers, inspectors, and holders. This presentation explores the benefits of implementing the Verifiable Claims data model using the RDF and Linked Data technology stack.
Metaphors define civilized life. They are all around us in the stories that we teach our children and tell each other to justify our actions. But social metaphors have a dark side. They can cause entire civilizations to self destruct. Metaphors can kill. This presentation explores the power, and danger, of metaphors as social memes.
These slides are from a talk given to the Fredericksburg Secular Humanists (FSH) in Fredericksburg, Virginia, on 8 November 2015. FSH is sub-chapter of the United Coalition of Reason (unitedcor.org). The talk compared the secular societies of the United States and Australia.
Building a writer's platform with social mediaDavid Wood
This presentation reports on my progress in trying to build my writer's platform using social media. It focuses on Twitter, but the advice is generally applicable. Kudos to my mentors @DanCitizen and @RayneHall.
A summary of the Hero's Journey, Joseph Campbell's formulation of the "monomyth" in mythology and literature. Originally presented to the Fredericksburg Writing as a Business Meetup, 24 January 2015.
Open Data is the idea that "certain data should be freely available to everyone to use and republish as they wish, without restrictions from copyright, patents or other mechanisms of control”. Open Data follows similar “open” concepts that have proven to be valuable in the information economy such as Open Standards, Open Source Software, Open Content and has been followed more recently by variations on the theme such as Open Science and Open Government.
Open Data allows information of common value to be reused without needing to be recreated. The economic benefits of Open Data include cost reduction, organizational efficiencies and the facilitation of commonly held understanding. The costs of implementing Open Data deployment strategies tend to be iterative on top of existing information infrastructure.
This presentation will describe Open Data and its place in the ecosystem of economic and governmental discourse.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
Generating a custom Ruby SDK for your web service or Rails API using Smithyg2nightmarescribd
Have you ever wanted a Ruby client API to communicate with your web service? Smithy is a protocol-agnostic language for defining services and SDKs. Smithy Ruby is an implementation of Smithy that generates a Ruby SDK using a Smithy model. In this talk, we will explore Smithy and Smithy Ruby to learn how to generate custom feature-rich SDKs that can communicate with any web service, such as a Rails JSON API.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
2. Permutations
● An ordered arrangement of objects is called a permutation.
■
Hence, a permutation of n distinct elements is an ordering of these
n elements.
● It is denoted by P(n,r) or nPr.
● Ordering of last four digits of a telephone number if digits are
allowed to repeat
■
10*10*10*10 = 10000
■
Ordering of four digits if repetition is not allowed = 10*9*8*7 =
5040 = 10!/6!
where n! = n*(n-1)*(n-2)*….*3*2*1 and by definition 0! = 1
● Hence, mathematically, for r ≤ n, an r-permutation from n
objects is defined by
● P(n,r) = n*(n-1)*(n-2)*…..*(n-r+1)
⇒ P(n,r) =
for 0 ≤ r ≤ n
● Hence, P(10,4) = 10! / (10-4)! = 10!/6! = 5040
Section 3.4 Permutations and Combinations 2
Thursday, March 11, 2010
3. Permutations: Some special cases
● P(n,0) = n! / n! = 1
● This means that there is only one ordered arrangement
of 0 objects, called the empty set.
● P(n,1) = n!/ (n-1)! = n
● There are n ordered arrangements of one object (i.e. n
ways of selecting one object from n objects).
● P(n,n) = n!/(n-n)! = n!/0! = n!
● This means that one can arrange n distinct objects in
n! ways, that is nothing but the multiplication
principle.
Section 3.4 Permutations and Combinations 3
Thursday, March 11, 2010
4. Permutation Examples
1. Ten athletes compete in an Olympic event. Gold, silver and
bronze medals are awarded to the first three in the event,
respectively. How many ways can the awards be presented?
2. How many ways can six people be seated on six
chairs?
3. How many permutations of the letters ABCDEF contain the
letters DEF together in any order?
4. The professor’s dilemma: how to arrange four books on OS,
seven on programming, and three on data structures on a shelf
such that books on the same subject must be
together?
Section 3.4 Permutations and Combinations 4
Thursday, March 11, 2010
5. Permutation Examples
1. Ten athletes compete in an Olympic event. Gold, silver and
bronze medals are awarded to the first three in the event,
respectively. How many ways can the awards be presented?
Hence, 3 objects from a pool of 10 = P(10,3) = 720
2. How many ways can six people be seated on six
chairs?
3. How many permutations of the letters ABCDEF contain the
letters DEF together in any order?
4. The professor’s dilemma: how to arrange four books on OS,
seven on programming, and three on data structures on a shelf
such that books on the same subject must be
together?
Section 3.4 Permutations and Combinations 4
Thursday, March 11, 2010
6. Permutation Examples
1. Ten athletes compete in an Olympic event. Gold, silver and
bronze medals are awarded to the first three in the event,
respectively. How many ways can the awards be presented?
Hence, 3 objects from a pool of 10 = P(10,3) = 720
2. How many ways can six people be seated on six
chairs?
P(6,6) = 6! = 720
3. How many permutations of the letters ABCDEF contain the
letters DEF together in any order?
4. The professor’s dilemma: how to arrange four books on OS,
seven on programming, and three on data structures on a shelf
such that books on the same subject must be
together?
Section 3.4 Permutations and Combinations 4
Thursday, March 11, 2010
7. Permutation Examples
1. Ten athletes compete in an Olympic event. Gold, silver and
bronze medals are awarded to the first three in the event,
respectively. How many ways can the awards be presented?
Hence, 3 objects from a pool of 10 = P(10,3) = 720
2. How many ways can six people be seated on six
chairs?
P(6,6) = 6! = 720
3. How many permutations of the letters ABCDEF contain the
letters DEF together in any order?
If DEF is considered as one letter, then we have 4 letters A B C DEF which
can be permuted in 4! ways, DEF can be ordered by its letters in 3! ways.
Hence, by the multiplication principle, total number of orderings
possible = 4!*3! = 24*6 = 144.
4. The professor’s dilemma: how to arrange four books on OS,
seven on programming, and three on data structures on a shelf
such that books on the same subject must be
together?
Section 3.4 Permutations and Combinations 4
Thursday, March 11, 2010
8. Permutation Examples
1. Ten athletes compete in an Olympic event. Gold, silver and
bronze medals are awarded to the first three in the event,
respectively. How many ways can the awards be presented?
Hence, 3 objects from a pool of 10 = P(10,3) = 720
2. How many ways can six people be seated on six
chairs?
P(6,6) = 6! = 720
3. How many permutations of the letters ABCDEF contain the
letters DEF together in any order?
If DEF is considered as one letter, then we have 4 letters A B C DEF which
can be permuted in 4! ways, DEF can be ordered by its letters in 3! ways.
Hence, by the multiplication principle, total number of orderings
possible = 4!*3! = 24*6 = 144.
4. The professor’s dilemma: how to arrange four books on OS,
seven on programming, and three on data structures on a shelf
such that books on the same subject must be
together?
(4!*7!*3*)*3! = 24*5040*6*6 = 4,354,560
Section 3.4 Permutations and Combinations 4
Thursday, March 11, 2010
9. Combinations
● When order in permutations becomes immaterial, i.e. we are just
interested in selecting r objects from n distinct objects, we talk
of combinations denoted by
C(n,r) or nCr
● For each combination, there are r! ways of ordering those r
chosen objects
● Hence, from multiplication principle,
● C(n,r)* r! = P(n,r) ⇒
■
Note: C(n,r) is much smaller than P(n,r) as seen from the graphs
below:
Section 3.4 Permutations and Combinations 5
Thursday, March 11, 2010
10. Combinations: Special Cases
● C(n,0) = 1
● Only one way to choose 0 objects from n objects-
chose the empty set
● C(n,1) = n
● Obvious, since n ways to choose one object from n
objects
● C(n,n) = 1
● Only one way to choose n objects from n objects
Section 3.4 Permutations and Combinations 6
Thursday, March 11, 2010
11. Combinations: Examples
● How many ways can we select a committee of three from 10?
● How many ways can a committee of two women and three men be
selected from a group of five different women and six different men?
● How many five-card poker hands can be dealt from a standard 52-card
deck?
● How many poker hands contain cards all of the same suit?
● How many poker hands contain three cards of one denomination and two
cards of another denomination?
Section 3.4 Permutations and Combinations 7
Thursday, March 11, 2010
12. Combinations: Examples
● How many ways can we select a committee of three from 10?
C(10,3) = 120
● How many ways can a committee of two women and three men be
selected from a group of five different women and six different men?
● How many five-card poker hands can be dealt from a standard 52-card
deck?
● How many poker hands contain cards all of the same suit?
● How many poker hands contain three cards of one denomination and two
cards of another denomination?
Section 3.4 Permutations and Combinations 7
Thursday, March 11, 2010
13. Combinations: Examples
● How many ways can we select a committee of three from 10?
C(10,3) = 120
● How many ways can a committee of two women and three men be
selected from a group of five different women and six different men?
For selecting two out of five women, we have C(5,2) ways = 10.
For selecting three out of six men, we have C(6,3) ways = 20.
Total number of ways for selecting the committee = 10*20 = 200
● How many five-card poker hands can be dealt from a standard 52-card
deck?
● How many poker hands contain cards all of the same suit?
● How many poker hands contain three cards of one denomination and two
cards of another denomination?
Section 3.4 Permutations and Combinations 7
Thursday, March 11, 2010
14. Combinations: Examples
● How many ways can we select a committee of three from 10?
C(10,3) = 120
● How many ways can a committee of two women and three men be
selected from a group of five different women and six different men?
For selecting two out of five women, we have C(5,2) ways = 10.
For selecting three out of six men, we have C(6,3) ways = 20.
Total number of ways for selecting the committee = 10*20 = 200
● How many five-card poker hands can be dealt from a standard 52-card
deck?
C(52,5) = 2,598,960
● How many poker hands contain cards all of the same suit?
● How many poker hands contain three cards of one denomination and two
cards of another denomination?
Section 3.4 Permutations and Combinations 7
Thursday, March 11, 2010
15. Combinations: Examples
● How many ways can we select a committee of three from 10?
C(10,3) = 120
● How many ways can a committee of two women and three men be
selected from a group of five different women and six different men?
For selecting two out of five women, we have C(5,2) ways = 10.
For selecting three out of six men, we have C(6,3) ways = 20.
Total number of ways for selecting the committee = 10*20 = 200
● How many five-card poker hands can be dealt from a standard 52-card
deck?
C(52,5) = 2,598,960
● How many poker hands contain cards all of the same suit?
4*C(13,5) = 5148
● How many poker hands contain three cards of one denomination and two
cards of another denomination?
Section 3.4 Permutations and Combinations 7
Thursday, March 11, 2010
16. Combinations: Examples
● How many ways can we select a committee of three from 10?
C(10,3) = 120
● How many ways can a committee of two women and three men be
selected from a group of five different women and six different men?
For selecting two out of five women, we have C(5,2) ways = 10.
For selecting three out of six men, we have C(6,3) ways = 20.
Total number of ways for selecting the committee = 10*20 = 200
● How many five-card poker hands can be dealt from a standard 52-card
deck?
C(52,5) = 2,598,960
● How many poker hands contain cards all of the same suit?
4*C(13,5) = 5148
● How many poker hands contain three cards of one denomination and two
cards of another denomination?
Order of events: Select first denomination, select three cards from this denomination,
select the second denomination, select two cards from this denomination
13*C(4,3)*12*C(4,2) = 3744.
Section 3.4 Permutations and Combinations 7
Thursday, March 11, 2010
17. Combinations: Examples
● How many routes are there from the lower-left corner of an n by n
square grid to the upper-right corner if we are restricted to traveling
only to the right (R) or upward (U)?
Consider a 4×4 grid. Total steps required to
get from A to B is 8. This can be a mixture of
R’s and U’s as shown by the two paths in green
and red above. So, 4 R’s and 4 U’s are required
but the order is in which step is taken when
is not important.
● In how many ways can three athletes be declared winners from a group
of 10 athletes who compete in an Olympic event?
Section 3.4 Permutations and Combinations 8
Thursday, March 11, 2010
18. Combinations: Examples
● How many routes are there from the lower-left corner of an n by n
square grid to the upper-right corner if we are restricted to traveling
only to the right (R) or upward (U)?
Consider a 4×4 grid. Total steps required to
get from A to B is 8. This can be a mixture of
R’s and U’s as shown by the two paths in green
and red above. So, 4 R’s and 4 U’s are required
but the order is in which step is taken when
is not important.
So, basically, we are selecting four objects from eight that can be done in C(8,4) ways.
For an n×n grid, one can form C(2n,n) such routes to go from lower-left to the
upper-right corner.
● In how many ways can three athletes be declared winners from a group
of 10 athletes who compete in an Olympic event?
Section 3.4 Permutations and Combinations 8
Thursday, March 11, 2010
19. Combinations: Examples
● How many routes are there from the lower-left corner of an n by n
square grid to the upper-right corner if we are restricted to traveling
only to the right (R) or upward (U)?
Consider a 4×4 grid. Total steps required to
get from A to B is 8. This can be a mixture of
R’s and U’s as shown by the two paths in green
and red above. So, 4 R’s and 4 U’s are required
but the order is in which step is taken when
is not important.
So, basically, we are selecting four objects from eight that can be done in C(8,4) ways.
For an n×n grid, one can form C(2n,n) such routes to go from lower-left to the
upper-right corner.
● In how many ways can three athletes be declared winners from a group
of 10 athletes who compete in an Olympic event?
C(10,3) = 120
(much less than to award three winners medals)
Section 3.4 Permutations and Combinations 8
Thursday, March 11, 2010
20. Eliminating Duplicates
● How many ways can a committee of two be chosen from four
men and three women and it must include at least one man.
● How many distinct permutations can be made from the
characters in the word FLORIDA?
● How many distinct permutations can be made from the
characters in the word MISSISSIPPI?
Section 3.4 Permutations and Combinations 9
Thursday, March 11, 2010
21. Eliminating Duplicates
● How many ways can a committee of two be chosen from four
men and three women and it must include at least one man.
● How many distinct permutations can be made from the
characters in the word FLORIDA?
● How many distinct permutations can be made from the
characters in the word MISSISSIPPI?
Section 3.4 Permutations and Combinations 9
Thursday, March 11, 2010
22. Eliminating Duplicates
● How many ways can a committee of two be chosen from four
men and three women and it must include at least one man.
Incorrect and impulsive answer = C(4,1)*C(6,1)
Correct answer = C(7,2) – C(3,2) = C(4,1)*C(6,1) – C(4,2)
C(4,2) is the number of committees with two men on it. It has to be subtracted
since we are counting it twice in C(4,1)*C(6,1).
C(7,2) = all committees possible
C(3,2) = all committees with no men on it
● How many distinct permutations can be made from the
characters in the word FLORIDA?
● How many distinct permutations can be made from the
characters in the word MISSISSIPPI?
Section 3.4 Permutations and Combinations 9
Thursday, March 11, 2010
23. Eliminating Duplicates
● How many ways can a committee of two be chosen from four
men and three women and it must include at least one man.
Incorrect and impulsive answer = C(4,1)*C(6,1)
Correct answer = C(7,2) – C(3,2) = C(4,1)*C(6,1) – C(4,2)
C(4,2) is the number of committees with two men on it. It has to be subtracted
since we are counting it twice in C(4,1)*C(6,1).
C(7,2) = all committees possible
C(3,2) = all committees with no men on it
● How many distinct permutations can be made from the
characters in the word FLORIDA? Simple: 7!
● How many distinct permutations can be made from the
characters in the word MISSISSIPPI?
Section 3.4 Permutations and Combinations 9
Thursday, March 11, 2010
24. Eliminating Duplicates
● How many ways can a committee of two be chosen from four
men and three women and it must include at least one man.
Incorrect and impulsive answer = C(4,1)*C(6,1)
Correct answer = C(7,2) – C(3,2) = C(4,1)*C(6,1) – C(4,2)
C(4,2) is the number of committees with two men on it. It has to be subtracted
since we are counting it twice in C(4,1)*C(6,1).
C(7,2) = all committees possible
C(3,2) = all committees with no men on it
● How many distinct permutations can be made from the
characters in the word FLORIDA? Simple: 7!
● How many distinct permutations can be made from the
characters in the word MISSISSIPPI?
Since we have more than one S, interchanging the S’s at the same position will not
result in a distinguishable change. Hence for four S’s, 4! possible permutations
that look alike.
Hence total number of permutations =
Section 3.4 Permutations and Combinations 9
Thursday, March 11, 2010
25. Summary of Counting Techniques
You want to count the number of… Technique to try:
Subsets of an n-element set Use formula 2n
Outcomes of successive events Multiply the number of outcomes for each
event.
Outcomes of disjoint events Add the number of outcomes for each event.
Outcomes of specific choices at each step Draw a decision tree and count the number
of paths.
Elements in overlapping sections of related Use principle of inclusion and exclusion
sets formula
Ordered arrangements of r out of n distinct Use P(n,r) formula
objects
Ways to select r out of n distinct objects Use C(n,r) formula
Ways to select r out of n distinct objects Use C(r+n-1, r) formula
with repetition allowed
Section 3.4 Permutations and Combinations 10
Thursday, March 11, 2010
Table 3.2, page 241 in your
text.
26. Class Exercises
● How many permutations of the characters in the word COMPUTER
are there? How many of these end in a vowel?
● How many distinct permutations of the characters in ERROR are
there?
● In how many ways can you seat 11 men and eight women in a row if
no two women are to sit together?
● A set of four coins is selected from a box containing five dimes and
seven quarters.
● Find the number of sets which has two dimes and two quarters.
● Find the number of sets composed of all dimes or all quarters.
Section 3.4 Permutations and Combinations 11
Thursday, March 11, 2010
27. Class Exercises
● How many permutations of the characters in the word COMPUTER
are there? How many of these end in a vowel?
8!
3.7!
● How many distinct permutations of the characters in ERROR are
there?
● In how many ways can you seat 11 men and eight women in a row if
no two women are to sit together?
● A set of four coins is selected from a box containing five dimes and
seven quarters.
● Find the number of sets which has two dimes and two quarters.
● Find the number of sets composed of all dimes or all quarters.
Section 3.4 Permutations and Combinations 11
Thursday, March 11, 2010
28. Class Exercises
● How many permutations of the characters in the word COMPUTER
are there? How many of these end in a vowel?
8!
3.7!
● How many distinct permutations of the characters in ERROR are
there?
5!/3!
● In how many ways can you seat 11 men and eight women in a row if
no two women are to sit together?
● A set of four coins is selected from a box containing five dimes and
seven quarters.
● Find the number of sets which has two dimes and two quarters.
● Find the number of sets composed of all dimes or all quarters.
Section 3.4 Permutations and Combinations 11
Thursday, March 11, 2010
29. Class Exercises
● How many permutations of the characters in the word COMPUTER
are there? How many of these end in a vowel?
8!
3.7!
● How many distinct permutations of the characters in ERROR are
there?
5!/3!
● In how many ways can you seat 11 men and eight women in a row if
no two women are to sit together?
11!*C(12,8)*8!
● A set of four coins is selected from a box containing five dimes and
seven quarters.
● Find the number of sets which has two dimes and two quarters.
● Find the number of sets composed of all dimes or all quarters.
Section 3.4 Permutations and Combinations 11
Thursday, March 11, 2010
30. Class Exercises
● How many permutations of the characters in the word COMPUTER
are there? How many of these end in a vowel?
8!
3.7!
● How many distinct permutations of the characters in ERROR are
there?
5!/3!
● In how many ways can you seat 11 men and eight women in a row if
no two women are to sit together?
11!*C(12,8)*8!
● A set of four coins is selected from a box containing five dimes and
seven quarters.
C(5,2)*C(7,2) = 10*21 = 210
● Find the number of sets which has two dimes and two quarters.
● Find the number of sets composed of all dimes or all quarters.
Section 3.4 Permutations and Combinations 11
Thursday, March 11, 2010
31. Class Exercises
● How many permutations of the characters in the word COMPUTER
are there? How many of these end in a vowel?
8!
3.7!
● How many distinct permutations of the characters in ERROR are
there?
5!/3!
● In how many ways can you seat 11 men and eight women in a row if
no two women are to sit together?
11!*C(12,8)*8!
● A set of four coins is selected from a box containing five dimes and
seven quarters.
C(5,2)*C(7,2) = 10*21 = 210
● Find the number of sets which has two dimes and two quarters.
C(5,4) + C(7,4) = 5 + 35 = 40
● Find the number of sets composed of all dimes or all quarters.
Section 3.4 Permutations and Combinations 11
Thursday, March 11, 2010
32. Class Exercises
● How many permutations of the characters in the word COMPUTER
are there? How many of these end in a vowel?
8!
3.7!
● How many distinct permutations of the characters in ERROR are
there?
5!/3!
● In how many ways can you seat 11 men and eight women in a row if
no two women are to sit together?
11!*C(12,8)*8!
● A set of four coins is selected from a box containing five dimes and
seven quarters.
C(5,2)*C(7,2) = 10*21 = 210
● Find the number of sets which has two dimes and two quarters.
C(5,4) + C(7,4) = 5 + 35 = 40
● Find the number of sets composed of all dimes or all quarters.
C(7,3)*C(5,1) + C(7,4) = 210
Section 3.4 Permutations and Combinations 11
Thursday, March 11, 2010
33. Set, Combinatorics,
Probability, and Number Theory
Mathematical
Structures for
Computer Science
Chapter 3
Section 3.6 Binomial Theorem
Thursday, March 11, 2010
34. Pascal’s Triangle
● Consider the following expressions for the binomials:
(a + b)0 = 1
(a + b)1 = a + b
(a + b)2 = a2 + 2ab + b2
(a + b)3 = a3 + 3a2b + 3ab2 + b3
(a + b)4 = a4 + 4a3b + 6a2b2 + 4ab3 + b4
● Row n of the triangle (n ≥ 0) consists of all the values C(n, r) for 0
≤ r ≤ n. Thus, the Pascal’s looks like this:
Row
C(0,0)
0
C(1,0) C(1,1)
1
C(2,0)
C(2,1)
C(2,2)
2
C(3,0) C(3,1) C(3,2) C(3,3)
3
C(4,0) C(4,1) C(4,2) C(4,3) C(4,4)
4
C(5,0) C(5,1) C(5,2) C(5,3) C(5,4) C(5,5)
5
C(n,0) C(n,1) ….…………
C(n,n−1) C(n,n) n
Section 3.6 Binomial Theorem 13
Thursday, March 11, 2010
35. Pascal’s Triangle
● The Pascal’s triangle can be written as:
C(0,0)
C(1,0) C(1,1)
C(2,0) C(2,1)
C(2,2)
C(3,0) C(3,1) C(3,2) C(3,3)
C(4,0) C(4,1)
C(4,2) C(4,3)
C(4,4)
C(5,0) C(5,1) C(5,2) C(5,3) C(5,4) C(5,5)
......
……….
C(n,0) C(n,1)
……….
C(n,n − 1) C(n,n)
● We note that C(n,k) = C(n − 1,k − 1) + C(n − 1,k) for 1≤ k ≤ n − 1
● Can be proved simply by expanding the right hand side and
simplifying.
Section 3.6 Binomial Theorem 14
Thursday, March 11, 2010
37. Binomial Theorem
● The binomial theorem provides us with a formula for the
expansion of (a + b)n.
● It states that for every nonnegative integer n:
● The terms C(n,k) in the above series is called the binomial
coefficient.
● Binomial theorem can be proved using mathematical induction.
Section 3.6 Binomial Theorem 16
Thursday, March 11, 2010
38. Exercises
● Expand (x + 1)5 using the binomial theorem
C(5,0)x5 + C(5,1)x4 + C(5,2)x3 + C(5,3)x4 + C(5,4)x1 + C(5,0)x0
● Expand (x − 3)4 using the binomial theorem
● What is the fifth term of (3a + 2b)7
● What is the coefficient of x5y2z2 in the expansion of (x + y + 2z)9 ?
● Use binomial theorem to prove that:
C(n,0) – C(n,1) + C(n,2) - …….+ (-1)nC(n,n) = 0
Section 3.6 Binomial Theorem 17
Thursday, March 11, 2010