From 385753eaef142bd481b24e9d5de5516571de04af Mon Sep 17 00:00:00 2001 From: Simon Veitner Date: Tue, 9 Jul 2024 00:47:54 +0200 Subject: [PATCH] Math --- _posts/2024-07-09-combination-permutation.md | 5 ++++- _posts/2024-07-09-introduction-probability.md | 3 +++ 2 files changed, 7 insertions(+), 1 deletion(-) diff --git a/_posts/2024-07-09-combination-permutation.md b/_posts/2024-07-09-combination-permutation.md index fb5d987..24da7a8 100644 --- a/_posts/2024-07-09-combination-permutation.md +++ b/_posts/2024-07-09-combination-permutation.md @@ -5,9 +5,12 @@ categories: tags: - Probability --- + # Permutations and Combinations -An ordered set of elements in $[n]={1,2,...,n}$ is called a *permutation*. +An ordered set of elements in $[n]=\{1,2,...,n\}$ is called a *permutation*. If we consider an ordered subset with r elements in a set of n elements we call this an *r permutation*. diff --git a/_posts/2024-07-09-introduction-probability.md b/_posts/2024-07-09-introduction-probability.md index 92a69b8..427888d 100644 --- a/_posts/2024-07-09-introduction-probability.md +++ b/_posts/2024-07-09-introduction-probability.md @@ -5,6 +5,9 @@ categories: tags: - Probability --- + # Introduction In this notebook I want to implement some of the ideas from [this lecture](https://www.youtube.com/watch?v=2Xwk6yNq9og) in Python.