From 57c7d902b7e074a721e7192e1d5f555ee489915c Mon Sep 17 00:00:00 2001 From: Lucas Roberts Date: Mon, 14 Oct 2024 18:32:42 -0400 Subject: [PATCH] correct ordered bell dp recursion --- _posts/2024-10-14-blog-post.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/_posts/2024-10-14-blog-post.md b/_posts/2024-10-14-blog-post.md index fb562fe..ed79240 100644 --- a/_posts/2024-10-14-blog-post.md +++ b/_posts/2024-10-14-blog-post.md @@ -108,7 +108,7 @@ $$k!{n \brace k}$$. To calculate these the recursion is easily seen as -$$b(n,k) = k{n-1 \brace k} + k{n-1 \brace k-1}$$. +$$b(n,k) = kb(n-1, k) + kb(n-1,k-1)$$. In other words we're multiplying both items by $$k$$. We can interpret this as each non-empty subset being distinguished in some way,