100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Summary Introduction to Probability (STK110 Chapter 4) $2.82   Add to cart

Summary

Summary Introduction to Probability (STK110 Chapter 4)

 17 views  0 purchase
  • Course
  • Institution
  • Book

Introduction to probability in STK 110 (namely factorials, counting principle, combinations and permutations with examples and formulas).

Preview 1 out of 2  pages

  • No
  • Chapter 4
  • March 27, 2022
  • 2
  • 2021/2022
  • Summary
avatar-seller
Introduction to Probability
Chapter 4
Numerical measure of the likelihood that an event will occur.
Experiment: process generates well- Experiment e.g: Tossing 2 coins
defined outcomes. ▪ How many possible outcomes? 2 x 2
▪ Toss coin Tree Diagram: graphical rep helps in
▪ Select part for inspection visualizing multiple-step experiment.
▪ Conduct sales call Suppose coin = tossed 3 times
▪ Roll die ▪ Step1: Draw columns 4 every
▪ Play football game experiment.
Outcomes: ▪ Step 2: From left 2 right, starting
▪ Head, Tail @ “start”, give all outcomes of 1st
▪ Defective, Non-defective event.
▪ Purchase, No-purchase ▪ Step 3: Repeat 4 other outcomes.
▪ 1, 2, 3, 4, 5, 6 ▪ Step 4: Climb branches & note
▪ Win, Lose, tie outcomes.
Sample Space: 4 experiment: set of
all experimental outcomes.

Event: outcome/set of outcomes of
random experiment.
e.g. event “even #” w/e die is rolled:
E = { 2, 4, 6 }
Factorials:
▪ N!=(N)(N-1)(N-2)….(1)
▪ 3 factorial is: 3! = 3x2x1
▪ 5 factorial is: 5! = 5x4x3x2x1
▪ 0! = 1
Combinations
Interested in det # of ways ”n” objs
may be selected from among ”N” objs
w/o regard 2 order in which “n” objs =
selected.
Counting Rules Each selection of ”n” objects = called a
Multiple-Step Experiments: described combination & total # of combos
as sequence of steps. If multiple-step of ”N” objs taken n @ time is
experiment has k steps w/ possible
outcomes on 1st step, possible
outcomes on 2nd step, & so on, total #
of experimental outcomes = given by: Or # of unordered subsets
(combinations) of size n chosen (w/o
replacement) from N available objs.

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller amywallace. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for $2.82. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

78075 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 14 years now

Start selling
$2.82
  • (0)
  Add to cart