# Probability

## Math 11 Chapter 2 Lesson 2: Permutation – Conjugation – Combination

Math 11 Chapter 2 Lesson 2: Permutation – Conjugation – Combination 1. Summary of theory 1.1. Permutation Given (n) different elements ((n ≥ 1)). Each ordering of a given (n) element, where each element is present exactly once, is called a permutation of (n) that element. Theorem The number of permutations of the given different …

## Math 11 Chapter 2 Lesson 3: Newton’s binomial

Math 11 Chapter 2 Lesson 3: Newton’s binomial 1. Summary of theory 1.1. Newton’s binomial formula a) Newton’s binomial formula: With (a, b) being arbitrary real numbers and for all natural numbers (n ≥ 1), we have: ({(a + b)^n} = C_n^0{a^n} + C_n^1{a^{n – 1}}b + … +) (C_n^{n – 1}a{b^{n – 1}} + …

## Math 11 Chapter 2 Lesson 4: Trials and Events

Math 11 Chapter 2 Lesson 4: Trials and Events 1. Summary of theory 1.1. Trials and events a. Random trial and sample space A random experiment (referred to as a test) is an experiment or an action that:( bullet ) Its result is unpredictable;( bullet ) The set of all possible outcomes of that trial …

## Math 11 Chapter 2 Lesson 1: Counting Rules

Math 11 Chapter 2 Lesson 1: Counting Rules 1. Summary of theory 1.1. Addition rule There are (k) options ({A_1},{A_2},{A_3},…,{A_k}) to do the job. In there: – There is ({n_1}) how to do the option ({A_1}), – There is ({n_2}) how to do the option ({A_2}) … – There is ({n_k}) how to do the …