The document provides examples and explanations of probability concepts involving unions and intersections of sets. Example 1a calculates the probability of rolling a sum of 2 or 3 when rolling two fair dice. It shows that this probability is the sum of the individual probabilities of getting a sum of 2 and a sum of 3, since these are mutually exclusive events. Example 1b similarly calculates the probability of an even sum or a sum greater than 4 when rolling two dice.
This material is for PGPSE / CSE students of AFTERSCHOOOL. PGPSE / CSE are free online programme - open for all - free for all - to promote entrepreneurship and social entrepreneurship PGPSE is for those who want to transform the world. It is different from MBA, BBA, CFA, CA,CS,ICWA and other traditional programmes. It is based on self certification and based on self learning and guidance by mentors. It is for those who want to be entrepreneurs and social changers. Let us work together. Our basic idea is that KNOWLEDGE IS FREE & AND SHARE IT WITH THE WORLD
This material is for PGPSE / CSE students of AFTERSCHOOOL. PGPSE / CSE are free online programme - open for all - free for all - to promote entrepreneurship and social entrepreneurship PGPSE is for those who want to transform the world. It is different from MBA, BBA, CFA, CA,CS,ICWA and other traditional programmes. It is based on self certification and based on self learning and guidance by mentors. It is for those who want to be entrepreneurs and social changers. Let us work together. Our basic idea is that KNOWLEDGE IS FREE & AND SHARE IT WITH THE WORLD
Prime Numbers: The Gateway To Algebra And Beyond!Dennis DiNoia
This hands-on workshop will show how to use prime numbers to simplify both numerical and
algebraic fractions, greatest common factors, least common multiples, simplifying roots and
determining patterns in sequences. This workshop is for anyone who is pre-algebra to pre-
calculus. The workshop is fast paced and fun whether you are a middle school student, high
school student or parent. This is a must for parents of younger children preparing for pre-
algebra!
This material is for PGPSE / CSE students of AFTERSCHOOOL. PGPSE / CSE are free online programme - open for all - free for all - to promote entrepreneurship and social entrepreneurship PGPSE is for those who want to transform the world. It is different from MBA, BBA, CFA, CA,CS,ICWA and other traditional programmes. It is based on self certification and based on self learning and guidance by mentors. It is for those who want to be entrepreneurs and social changers. Let us work together. Our basic idea is that KNOWLEDGE IS FREE & AND SHARE IT WITH THE WORLD
Prime Numbers: The Gateway To Algebra And Beyond!Dennis DiNoia
This hands-on workshop will show how to use prime numbers to simplify both numerical and
algebraic fractions, greatest common factors, least common multiples, simplifying roots and
determining patterns in sequences. This workshop is for anyone who is pre-algebra to pre-
calculus. The workshop is fast paced and fun whether you are a middle school student, high
school student or parent. This is a must for parents of younger children preparing for pre-
algebra!
This material is for PGPSE / CSE students of AFTERSCHOOOL. PGPSE / CSE are free online programme - open for all - free for all - to promote entrepreneurship and social entrepreneurship PGPSE is for those who want to transform the world. It is different from MBA, BBA, CFA, CA,CS,ICWA and other traditional programmes. It is based on self certification and based on self learning and guidance by mentors. It is for those who want to be entrepreneurs and social changers. Let us work together. Our basic idea is that KNOWLEDGE IS FREE & AND SHARE IT WITH THE WORLD
Linear equations in two variables. Please download the powerpoint file to enable animation.
Disclaimer: Some parts of the presentation are obtained from various sources. Credit to the rightful owners.
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.
A tale of scale & speed: How the US Navy is enabling software delivery from l...sonjaschweigert1
Rapid and secure feature delivery is a goal across every application team and every branch of the DoD. The Navy’s DevSecOps platform, Party Barge, has achieved:
- Reduction in onboarding time from 5 weeks to 1 day
- Improved developer experience and productivity through actionable findings and reduction of false positives
- Maintenance of superior security standards and inherent policy enforcement with Authorization to Operate (ATO)
Development teams can ship efficiently and ensure applications are cyber ready for Navy Authorizing Officials (AOs). In this webinar, Sigma Defense and Anchore will give attendees a look behind the scenes and demo secure pipeline automation and security artifacts that speed up application ATO and time to production.
We will cover:
- How to remove silos in DevSecOps
- How to build efficient development pipeline roles and component templates
- How to deliver security artifacts that matter for ATO’s (SBOMs, vulnerability reports, and policy evidence)
- How to streamline operations with automated policy checks on container images
Essentials of Automations: The Art of Triggers and Actions in FMESafe Software
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
Enhancing Performance with Globus and the Science DMZGlobus
ESnet has led the way in helping national facilities—and many other institutions in the research community—configure Science DMZs and troubleshoot network issues to maximize data transfer performance. In this talk we will present a summary of approaches and tips for getting the most out of your network infrastructure using Globus Connect Server.
Generative AI Deep Dive: Advancing from Proof of Concept to ProductionAggregage
Join Maher Hanafi, VP of Engineering at Betterworks, in this new session where he'll share a practical framework to transform Gen AI prototypes into impactful products! He'll delve into the complexities of data collection and management, model selection and optimization, and ensuring security, scalability, and responsible use.
The Metaverse and AI: how can decision-makers harness the Metaverse for their...Jen Stirrup
The Metaverse is popularized in science fiction, and now it is becoming closer to being a part of our daily lives through the use of social media and shopping companies. How can businesses survive in a world where Artificial Intelligence is becoming the present as well as the future of technology, and how does the Metaverse fit into business strategy when futurist ideas are developing into reality at accelerated rates? How do we do this when our data isn't up to scratch? How can we move towards success with our data so we are set up for the Metaverse when it arrives?
How can you help your company evolve, adapt, and succeed using Artificial Intelligence and the Metaverse to stay ahead of the competition? What are the potential issues, complications, and benefits that these technologies could bring to us and our organizations? In this session, Jen Stirrup will explain how to start thinking about these technologies as an organisation.
Climate Impact of Software Testing at Nordic Testing DaysKari Kakkonen
My slides at Nordic Testing Days 6.6.2024
Climate impact / sustainability of software testing discussed on the talk. ICT and testing must carry their part of global responsibility to help with the climat warming. We can minimize the carbon footprint but we can also have a carbon handprint, a positive impact on the climate. Quality characteristics can be added with sustainability, and then measured continuously. Test environments can be used less, and in smaller scale and on demand. Test techniques can be used in optimizing or minimizing number of tests. Test automation can be used to speed up testing.
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.
Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...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.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Removing Uninteresting Bytes in Software FuzzingAftab Hussain
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
2. Warm-up
How many positive integers less than or equal to 1000
satisfy each condition?
a. Divisible by 5? b. Divisible by 7?
Divisible by 5 or 7?
3. Warm-up
How many positive integers less than or equal to 1000
satisfy each condition?
a. Divisible by 5? b. Divisible by 7?
200
Divisible by 5 or 7?
4. Warm-up
How many positive integers less than or equal to 1000
satisfy each condition?
a. Divisible by 5? b. Divisible by 7?
200 142
Divisible by 5 or 7?
5. Warm-up
How many positive integers less than or equal to 1000
satisfy each condition?
a. Divisible by 5? b. Divisible by 7?
200 142
Divisible by 5 or 7?
314
7. Union: Values that are in one set or another; does not
need to be part of both
8. Union: Values that are in one set or another; does not
need to be part of both
Notation: A B
9. Union: Values that are in one set or another; does not
need to be part of both
Notation: A B
Disjoint/Mutually Exclusive:
10. Union: Values that are in one set or another; does not
need to be part of both
Notation: A B
Disjoint/Mutually Exclusive: A situation where two or
more sets have nothing in common
11. Union: Values that are in one set or another; does not
need to be part of both
Notation: A B
Disjoint/Mutually Exclusive: A situation where two or
more sets have nothing in common
i.e. Rolling a sum of 2 or 3 on a pair of dice; you can’t
have them both happen at the same time
12. Union: Values that are in one set or another; does not
need to be part of both
Notation: A B
Disjoint/Mutually Exclusive: A situation where two or
more sets have nothing in common
i.e. Rolling a sum of 2 or 3 on a pair of dice; you can’t
have them both happen at the same time
Intersection:
13. Union: Values that are in one set or another; does not
need to be part of both
Notation: A B
Disjoint/Mutually Exclusive: A situation where two or
more sets have nothing in common
i.e. Rolling a sum of 2 or 3 on a pair of dice; you can’t
have them both happen at the same time
Intersection: Values that are shared by two or more sets
14. Union: Values that are in one set or another; does not
need to be part of both
Notation: A B
Disjoint/Mutually Exclusive: A situation where two or
more sets have nothing in common
i.e. Rolling a sum of 2 or 3 on a pair of dice; you can’t
have them both happen at the same time
Intersection: Values that are shared by two or more sets
Notation: A B
16. Addition Counting Principle (Mutually Exclusive Form):
If two finite sets A and B are mutually exclusive, then
N( A B) = N( A) + N(B)
17. Addition Counting Principle (Mutually Exclusive Form):
If two finite sets A and B are mutually exclusive, then
N( A B) = N( A) + N(B)
Theorem (Probability of the Union of Mutually Exclusive Events):
18. Addition Counting Principle (Mutually Exclusive Form):
If two finite sets A and B are mutually exclusive, then
N( A B) = N( A) + N(B)
Theorem (Probability of the Union of Mutually Exclusive Events):
If A and B are mutually exclusive events in the same finite
sample space, then
P( A B) = P( A) + P(B)
19. Example 1
a. If two fair dice are tossed, what is the probability that
the sum is 2 or 3?
20. Example 1
a. If two fair dice are tossed, what is the probability that
the sum is 2 or 3?
1,1 1,2 1,3 1,4 1,5 1,6
2,1 2,2 2,3 2,4 2,5 2,6
3,1 3,2 3,3 3,4 3,5 3,6
4,1 4,2 4,3 4,4 4,5 4,6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
21. Example 1
a. If two fair dice are tossed, what is the probability that
the sum is 2 or 3?
1,1 1,2 1,3 1,4 1,5 1,6 P(sum of 2 or 3)
2,1 2,2 2,3 2,4 2,5 2,6
3,1 3,2 3,3 3,4 3,5 3,6
4,1 4,2 4,3 4,4 4,5 4,6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
22. Example 1
a. If two fair dice are tossed, what is the probability that
the sum is 2 or 3?
1,1 1,2 1,3 1,4 1,5 1,6 P(sum of 2 or 3)
2,1 2,2 2,3 2,4 2,5 2,6 = P(sum of 2) + P(sum of 3)
3,1 3,2 3,3 3,4 3,5 3,6
4,1 4,2 4,3 4,4 4,5 4,6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
23. Example 1
a. If two fair dice are tossed, what is the probability that
the sum is 2 or 3?
1,1 1,2 1,3 1,4 1,5 1,6 P(sum of 2 or 3)
2,1 2,2 2,3 2,4 2,5 2,6 = P(sum of 2) + P(sum of 3)
3,1 3,2 3,3 3,4 3,5 3,6
4,1 4,2 4,3 4,4 4,5 4,6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
24. Example 1
a. If two fair dice are tossed, what is the probability that
the sum is 2 or 3?
1,1 1,2 1,3 1,4 1,5 1,6 P(sum of 2 or 3)
2,1 2,2 2,3 2,4 2,5 2,6 = P(sum of 2) + P(sum of 3)
3,1 3,2 3,3 3,4 3,5 3,6
4,1 4,2 4,3 4,4 4,5 4,6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
25. Example 1
a. If two fair dice are tossed, what is the probability that
the sum is 2 or 3?
1,1 1,2 1,3 1,4 1,5 1,6 P(sum of 2 or 3)
2,1 2,2 2,3 2,4 2,5 2,6 = P(sum of 2) + P(sum of 3)
3,1 3,2 3,3 3,4 3,5 3,6 = 1
36
+ 36
2
4,1 4,2 4,3 4,4 4,5 4,6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
26. Example 1
a. If two fair dice are tossed, what is the probability that
the sum is 2 or 3?
1,1 1,2 1,3 1,4 1,5 1,6 P(sum of 2 or 3)
2,1 2,2 2,3 2,4 2,5 2,6 = P(sum of 2) + P(sum of 3)
3,1 3,2 3,3 3,4 3,5 3,6 = 1
36
+ 36 =
2 3
36
4,1 4,2 4,3 4,4 4,5 4,6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
27. Example 1
a. If two fair dice are tossed, what is the probability that
the sum is 2 or 3?
1,1 1,2 1,3 1,4 1,5 1,6 P(sum of 2 or 3)
2,1 2,2 2,3 2,4 2,5 2,6 = P(sum of 2) + P(sum of 3)
3,1 3,2 3,3 3,4 3,5 3,6 = 1
36
+ 36 =
2 3
36
= 12
1
4,1 4,2 4,3 4,4 4,5 4,6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
28. Example 1
a. If two fair dice are tossed, what is the probability that
the sum is 2 or 3?
1,1 1,2 1,3 1,4 1,5 1,6 P(sum of 2 or 3)
2,1 2,2 2,3 2,4 2,5 2,6 = P(sum of 2) + P(sum of 3)
3,1 3,2 3,3 3,4 3,5 3,6 = 1
36
+ 36 =
2 3
36
= 12
1
4,1 4,2 4,3 4,4 4,5 4,6 There is an 8 1/3 %
5,1 5,2 5,3 5,4 5,5 5,6 chance of rolling a sum
6,1 6,2 6,3 6,4 6,5 6,6 of 2 or 3
29. Example 1
b. If two dice are tossed, what is the probability that the
sum will be even or greater than 4?
30. Example 1
b. If two dice are tossed, what is the probability that the
sum will be even or greater than 4?
1,1 1,2 1,3 1,4 1,5 1,6
2,1 2,2 2,3 2,4 2,5 2,6
3,1 3,2 3,3 3,4 3,5 3,6
4,1 4,2 4,3 4,4 4,5 4,6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
31. Example 1
b. If two dice are tossed, what is the probability that the
sum will be even or greater than 4?
P(sum is even or > 4)
1,1 1,2 1,3 1,4 1,5 1,6
2,1 2,2 2,3 2,4 2,5 2,6
3,1 3,2 3,3 3,4 3,5 3,6
4,1 4,2 4,3 4,4 4,5 4,6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
32. Example 1
b. If two dice are tossed, what is the probability that the
sum will be even or greater than 4?
P(sum is even or > 4)
1,1 1,2 1,3 1,4 1,5 1,6
= P(sum is even) + P(sum > 4)
2,1 2,2 2,3 2,4 2,5 2,6
3,1 3,2 3,3 3,4 3,5 3,6
4,1 4,2 4,3 4,4 4,5 4,6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
33. Example 1
b. If two dice are tossed, what is the probability that the
sum will be even or greater than 4?
P(sum is even or > 4)
1,1 1,2 1,3 1,4 1,5 1,6
= P(sum is even) + P(sum > 4)
2,1 2,2 2,3 2,4 2,5 2,6
3,1 3,2 3,3 3,4 3,5 3,6
4,1 4,2 4,3 4,4 4,5 4,6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
34. Example 1
b. If two dice are tossed, what is the probability that the
sum will be even or greater than 4?
P(sum is even or > 4)
1,1 1,2 1,3 1,4 1,5 1,6
= P(sum is even) + P(sum > 4)
2,1 2,2 2,3 2,4 2,5 2,6
3,1 3,2 3,3 3,4 3,5 3,6
4,1 4,2 4,3 4,4 4,5 4,6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
35. Example 1
b. If two dice are tossed, what is the probability that the
sum will be even or greater than 4?
P(sum is even or > 4)
1,1 1,2 1,3 1,4 1,5 1,6
= P(sum is even) + P(sum > 4)
2,1 2,2 2,3 2,4 2,5 2,6
= 36
18
3,1 3,2 3,3 3,4 3,5 3,6
4,1 4,2 4,3 4,4 4,5 4,6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
36. Example 1
b. If two dice are tossed, what is the probability that the
sum will be even or greater than 4?
P(sum is even or > 4)
1,1 1,2 1,3 1,4 1,5 1,6
= P(sum is even) + P(sum > 4)
2,1 2,2 2,3 2,4 2,5 2,6
= 36 + 36
18 30
3,1 3,2 3,3 3,4 3,5 3,6
4,1 4,2 4,3 4,4 4,5 4,6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
37. Example 1
b. If two dice are tossed, what is the probability that the
sum will be even or greater than 4?
P(sum is even or > 4)
1,1 1,2 1,3 1,4 1,5 1,6
= P(sum is even) + P(sum > 4)
2,1 2,2 2,3 2,4 2,5 2,6
= 36 + 36 − 36
18 30 14
3,1 3,2 3,3 3,4 3,5 3,6
4,1 4,2 4,3 4,4 4,5 4,6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
38. Example 1
b. If two dice are tossed, what is the probability that the
sum will be even or greater than 4?
P(sum is even or > 4)
1,1 1,2 1,3 1,4 1,5 1,6
= P(sum is even) + P(sum > 4)
2,1 2,2 2,3 2,4 2,5 2,6
= 36 + 36 − 36 = 36
18 30 14 34
3,1 3,2 3,3 3,4 3,5 3,6
4,1 4,2 4,3 4,4 4,5 4,6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
39. Example 1
b. If two dice are tossed, what is the probability that the
sum will be even or greater than 4?
P(sum is even or > 4)
1,1 1,2 1,3 1,4 1,5 1,6
= P(sum is even) + P(sum > 4)
2,1 2,2 2,3 2,4 2,5 2,6
= 36 + 36 − 36 = 36 = 18
18 30 14 34 17
3,1 3,2 3,3 3,4 3,5 3,6
4,1 4,2 4,3 4,4 4,5 4,6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
40. Example 1
b. If two dice are tossed, what is the probability that the
sum will be even or greater than 4?
P(sum is even or > 4)
1,1 1,2 1,3 1,4 1,5 1,6
= P(sum is even) + P(sum > 4)
2,1 2,2 2,3 2,4 2,5 2,6
= 36 + 36 − 36 = 36 = 18
18 30 14 34 17
3,1 3,2 3,3 3,4 3,5 3,6
4,1 4,2 4,3 4,4 4,5 4,6 There is a 94 4/9 %
5,1 5,2 5,3 5,4 5,5 5,6 chance of rolling an
even sum or a sum
6,1 6,2 6,3 6,4 6,5 6,6 greater than 4
42. Addition Counting Principle (General Form):
For any finite sets A and B,
N( A B) = N( A) + N(B) − N( A B)
43. Addition Counting Principle (General Form):
For any finite sets A and B,
N( A B) = N( A) + N(B) − N( A B)
Theorem (Probability of a Union of Events General Form):
44. Addition Counting Principle (General Form):
For any finite sets A and B,
N( A B) = N( A) + N(B) − N( A B)
Theorem (Probability of a Union of Events General Form):
If A and B are any events in the same finite sample space,
then
P( A or B) = P( A B) = P( A) + P(B) − P( A B)
45. Example 2
Thirteen of the 50 states include territory that lies west of
the continental divide. Forty-two states include territory
that lies east of the continental divide. Is this possible?
Explain.
46. Example 2
Thirteen of the 50 states include territory that lies west of
the continental divide. Forty-two states include territory
that lies east of the continental divide. Is this possible?
Explain.
Of course this is possible! This just means that some states
have the continental divide running right though them!
47. Example 2
Thirteen of the 50 states include territory that lies west of
the continental divide. Forty-two states include territory
that lies east of the continental divide. Is this possible?
Explain.
Of course this is possible! This just means that some states
have the continental divide running right though them!
Bonus: Which states would these be? The FIRST person
to post the correct answer AFTER 7 PM on the wiki
under section 7-2 will earn some bonus points!
48. Example 3
Three fair coins are tossed. What is the probability that not
all of the coins show the same face?
49. Example 3
Three fair coins are tossed. What is the probability that not
all of the coins show the same face?
HHH HTT
HHT THT
HTH TTH
THH TTT
50. Example 3
Three fair coins are tossed. What is the probability that not
all of the coins show the same face?
HHH HTT
HHT THT
HTH TTH
THH TTT
51. Example 3
Three fair coins are tossed. What is the probability that not
all of the coins show the same face?
P(Not all 3 same)
HHH HTT
HHT THT
HTH TTH
THH TTT
52. Example 3
Three fair coins are tossed. What is the probability that not
all of the coins show the same face?
P(Not all 3 same)
HHH HTT = 6
8
HHT THT
HTH TTH
THH TTT
53. Example 3
Three fair coins are tossed. What is the probability that not
all of the coins show the same face?
P(Not all 3 same)
HHH HTT = 6
8
= 3
4
HHT THT
HTH TTH
THH TTT
54. Example 3
Three fair coins are tossed. What is the probability that not
all of the coins show the same face?
P(Not all 3 same)
HHH HTT = 6
8
= 3
4
HHT THT
HTH TTH There is a 75%
THH TTT chance of
getting not all 3
coins the same
56. Complementary Events
When you have events whose union takes up the entire
sample space, but the events are mutually exclusive
57. Complementary Events
When you have events whose union takes up the entire
sample space, but the events are mutually exclusive
The complement of R is not R
58. Example 4
Two dice are tossed. Find the probability that their sum is
not 6.
59. Example 4
Two dice are tossed. Find the probability that their sum is
not 6.
1,1 1,2 1,3 1,4 1,5 1,6
2,1 2,2 2,3 2,4 2,5 2,6
3,1 3,2 3,3 3,4 3,5 3,6
4,1 4,2 4,3 4,4 4,5 4,6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
60. Example 4
Two dice are tossed. Find the probability that their sum is
not 6.
1,1 1,2 1,3 1,4 1,5 1,6
2,1 2,2 2,3 2,4 2,5 2,6
3,1 3,2 3,3 3,4 3,5 3,6
4,1 4,2 4,3 4,4 4,5 4,6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
61. Example 4
Two dice are tossed. Find the probability that their sum is
not 6.
1,1 1,2 1,3 1,4 1,5 1,6 P(not 6)
2,1 2,2 2,3 2,4 2,5 2,6
3,1 3,2 3,3 3,4 3,5 3,6
4,1 4,2 4,3 4,4 4,5 4,6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
62. Example 4
Two dice are tossed. Find the probability that their sum is
not 6.
1,1 1,2 1,3 1,4 1,5 1,6 P(not 6) = 31
36
2,1 2,2 2,3 2,4 2,5 2,6
3,1 3,2 3,3 3,4 3,5 3,6
4,1 4,2 4,3 4,4 4,5 4,6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
63. Example 4
Two dice are tossed. Find the probability that their sum is
not 6.
1,1 1,2 1,3 1,4 1,5 1,6 P(not 6) = 31
36
2,1 2,2 2,3 2,4 2,5 2,6
3,1 3,2 3,3 3,4 3,5 3,6 There is an 86 1/9 %
chance that the sum
4,1 4,2 4,3 4,4 4,5 4,6 will not be 6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6
64. Example 4
Two dice are tossed. Find the probability that their sum is
not 6.
1,1 1,2 1,3 1,4 1,5 1,6 P(not 6) = 31
36
2,1 2,2 2,3 2,4 2,5 2,6
3,1 3,2 3,3 3,4 3,5 3,6 There is an 86 1/9 %
chance that the sum
4,1 4,2 4,3 4,4 4,5 4,6 will not be 6
5,1 5,2 5,3 5,4 5,5 5,6
6,1 6,2 6,3 6,4 6,5 6,6 1− P(6) =1− 5
36
= 31
36