Back to homeMathematics · 1st Bach. Social Sciences · Change subject
Start for free
BAC1 ss · Mathematics
Probability · Probability

Counting techniques

Laplace's rule, $P(A) = \frac{\text{favorables}}{\text{posibles}}$, is easy to state but sometimes very hard to apply: how many different menus are there? In how many ways can three prizes be shared among eight players? Counting one by one becomes impossible as soon as the numbers grow. This section gives you the tools to count without listing: the multiplication principle and the two most common types of counting, depending on whether or not order matters.

Before you start, make sure you know: Laplace's rule (2nd ESO)
Before you start, make sure you know: Introduction to combinatorics (4th ESO)

Tree diagrams and the multiplication principle

Tree diagram with two stages illustrating the multiplication principle to obtain 6 possible paths. … 3 × 2 = 6 paths stage 1 (3 options)
Practice★☆☆Not started
A streaming* platform lets you customize your user profile by choosing an avatar from 4 different animals (lion, panda, cat and wolf) and a background color from 3…

A streaming platform lets you customize your user profile by choosing an avatar from 4 different animals (lion, panda, cat and wolf) and a background color from 3 options (blue, green and orange).

  1. a) Describe the sample space $E$ of the possible profile combinations.
  1. b) How many elements does the sample space have? Use the multiplication principle to justify it.
Solve
Practice★☆☆Not started
In your school cafeteria menu you can choose a starter between salad, pasta or rice; a main course between chicken or fish; and a dessert between fruit or yoghurt. a)…

In your school cafeteria menu you can choose a starter between salad, pasta or rice; a main course between chicken or fish; and a dessert between fruit or yoghurt.

  1. a) Represent all possible complete menu options using a tree diagram.
  2. b) If you choose a menu at random, what is the probability that it includes "pasta" as a starter?
Solve

Permutations of selections: choosing and ordering

When several elements are chosen and ordered without repetition (a podium, a set of different posts), the count is called a permutation of a selection (known in Spanish as a variación). When repetition is allowed (a code, a password), it is a permutation with repetition.

Diagram of sequential assignment of options illustrating permutations without repetition when allocating ordered places. 3-digit padlock (1-5) with repetition: 5³ = 125 codes 3 trophies among 8 players without repetition: 8·7·6 = 336
Practice★☆☆Not started
A combination padlock for a locker has a 3-digit code. Each digit can be a number from $1$ to $5$. a) How many different combinations can be created if numbers can be…

A combination padlock for a locker has a 3-digit code. Each digit can be a number from $1$ to $5$.

  1. a) How many different combinations can be created if numbers can be repeated?
  2. b) How many combinations are there if the three numbers must be distinct?
Options: {1, 2, 3, 4, 5} 5 ? 2 1 ? 3 4 ? 1 Digit 1 Digit 2 Digit 3
Solve
Practice★☆☆Not started
In a local chess tournament 8 players participate. Three different trophies will be awarded for first, second and third place. a) In how many different ways can the…

In a local chess tournament 8 players participate. Three different trophies will be awarded for first, second and third place.

  1. a) In how many different ways can the three prizes be awarded?
  2. b) If last year's champion participates again and we are certain he will finish in the top three, how many podium finishes are possible now?
CHESS TOURNAMENT: POSSIBLE STANDINGS a) Open Distribution (Anyone can win) 8 Players in total Choose 3 places 3 1 2 Total formas = ? b) Champion Guaranteed on the Podium Champion 7 Remaining players 3 Options Cover 2 places 3 1 2 3 opciones × ? ways (rest) Nuevas formas = ?
Solve

Combinations: choosing without ordering

When several elements are chosen and the order does not matter (a committee, a selection of songs, a hand of cards), the count is called a combination and is calculated with the binomial coefficient $\binom{n}{k}$, read "$n$ choose $k$".

Diagram of the calculation of combinations for choosing 4 songs from a total of 10 when the order does not matter. choose 4 songs from 10 for the album, order does not matter C(10,4) = 10!/(4!·6!) = 210 different selections
Practice★☆☆Not started
A band has prepared 10 songs for their new album, but the record label tells them they can only include 4 of them. a) How many different selections of 4 songs can they…

A band has prepared 10 songs for their new album, but the record label tells them they can only include 4 of them.

  1. a) How many different selections of 4 songs can they make if the order does not matter in which they are chosen?
  2. b) What are these types of groupings called in combinatorics? Justify your answer.
Solve
Practice★★☆Not started
A streaming platform uses a security code for parental control. The code consists of 2 letters (from a 26-letter alphabet, without Ñ) followed by 3 digits (from 0 to 9).…

A streaming platform uses a security code for parental control. The code consists of 2 letters (from a 26-letter alphabet, without Ñ) followed by 3 digits (from 0 to 9).

  • a) How many different codes can be created if letters and numbers can be repeated?

  • b) If a user forgets their code but remembers that it begins with the letter "A" and ends with the number "7", how many possible combinations would they have to try?

  • c) If the code were generated at random without allowing any repeated characters (letters or numbers), what would be the probability of the code being "BX123"?

Solve

Draws with and without replacement

Comparative diagram of the number of elements available in successive draws with and without replacement. with replacement 10 → 10 → 10 … each time there are10 options without replacement 10 → 9 → 8 … each time oneoption fewer
Practice★★☆Not started
A survey was conducted among 200 young people about their reading and television viewing habits. The data are shown in the following contingency table: | | Reads…

A survey was conducted among 200 young people about their reading and television viewing habits. The data are shown in the following contingency table:

Reads regularly Does not read regularly Total
Watches TV > 2 h/day 35 85 120
Watches TV < 2 h/day 55 25 80
Total 90 110 200

If a young person is chosen at random from this survey, calculate:

  • a) The probability that they read regularly and watch television less than 2 hours a day.

  • b) Given that the young person reads regularly, what is the probability that they watch television more than 2 hours a day?

  • c) Are the events "Reads regularly" and "Watches television more than 2 hours a day" independent? Justify your answer mathematically.

Solve
Practice★★★Not started
A logistics company organizes its routes using a barcode of $10$ vertical stripes. Each stripe can be black, grey or white. For scanner readability reasons, codes with…

A logistics company organizes its routes using a barcode of $10$ vertical stripes. Each stripe can be black, grey or white. For scanner readability reasons, codes with three consecutive stripes of the same colour are not allowed.

  1. How many different codes of $10$ stripes can be formed in total (without restrictions)?

  2. If a code is chosen at random from all possible codes (without restrictions), what is the probability that the stripes in the odd positions are all black and those in the even positions are all white or grey?

Solve

Summary

See all the exercises in this section