Difference between revisions of "Geometric probability"

m (Examples)
(Introduction)
Line 1: Line 1:
 +
==Geometric Counting and Probability==
 +
https://youtu.be/OOdK-nOzaII?t=1858
 +
 
== Introduction ==
 
== Introduction ==
 
When dealing with a [[probability]] problem involving [[discrete]] quantities, we often times just use the fact that probability is the ratio of the number of successful outcomes to the number of total outcomes.
 
When dealing with a [[probability]] problem involving [[discrete]] quantities, we often times just use the fact that probability is the ratio of the number of successful outcomes to the number of total outcomes.

Revision as of 19:46, 12 August 2020

Geometric Counting and Probability

https://youtu.be/OOdK-nOzaII?t=1858

Introduction

When dealing with a probability problem involving discrete quantities, we often times just use the fact that probability is the ratio of the number of successful outcomes to the number of total outcomes.

However, we can have a situation where the quantities are continuous. We can still use the same notion that probability is the ratio of successful outcomes to total outcomes, but we cannot simply count the number of successful outcomes and the number of total outcomes. Instead, we have to find the size of each set. This is where we turn to geometric probability. We can usually translate a probability problem into a geometry problem. We can use length for one dimension, area for two dimensions, or volume for three dimensions.

Examples