ผลต่างระหว่างรุ่นของ "Probstat/week2 practice 1"

จาก Theory Wiki
ไปยังการนำทาง ไปยังการค้นหา
แถว 14: แถว 14:
  
 
== Counting ==
 
== Counting ==
 +
 +
1. We have a bag with <math>n</math> different objects.  We randomly choose <math>k</math> objects from the bag, one by one, without replacement.  I.e., we choose the first object randomly, keep it, then we choose the second object randomly, keep it, and so on.  How many ways can we choose <math>k</math> objects?
 +
 +
From the previous question, if we let <math>k=n</math>, i.e., we choose ''all'' objects, for a certain way of choosing, we obtain on ordered arrangement of <math>n</math> objects.  This arrangement is called a '''permutation'''.
  
 
== Permutation and combination ==
 
== Permutation and combination ==
  
 
== Exercises ==
 
== Exercises ==

รุ่นแก้ไขเมื่อ 23:50, 25 สิงหาคม 2557

This is part of probstat

Conditional probability review

1. Consider a sample space . We randomly pick an integer from .

1.1 What is the probability that a random number from is divisible by 2 given that it is divisible by 3.

1.2 Are events "an integer divisible by 2 is picked" and "an integer divisible by 3 is picked" independent?

1.3 What is the probability that a random number from is divisible by 4 given that it is divisible by 3.

1.4 Are events "an integer divisible by 4 is picked" and "an integer divisible by 3 is picked" independent?

Counting

1. We have a bag with different objects. We randomly choose objects from the bag, one by one, without replacement. I.e., we choose the first object randomly, keep it, then we choose the second object randomly, keep it, and so on. How many ways can we choose objects?

From the previous question, if we let , i.e., we choose all objects, for a certain way of choosing, we obtain on ordered arrangement of objects. This arrangement is called a permutation.

Permutation and combination

Exercises