From c3929536754998f8915f991884183c5155a44ac9 Mon Sep 17 00:00:00 2001
From: depsterr <depsterr@protonmail.com>
Date: Sat, 24 Dec 2022 02:04:12 +0100
Subject: [PATCH] add rough draft for fibbonacci post

---
 _drafts/fibbonacci.md | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)
 create mode 100644 _drafts/fibbonacci.md

diff --git a/_drafts/fibbonacci.md b/_drafts/fibbonacci.md
new file mode 100644
index 0000000..7edd775
--- /dev/null
+++ b/_drafts/fibbonacci.md
@@ -0,0 +1,16 @@
+---
+layout: post
+title: "Fibbonacci"
+---
+
+{% katexmm %}
+
+When talking about recurisve sequences there is a poster child, the fibbonacci sequence. $F_{n} = F_{n-1} + F_{n-2}$, but did you know there is a closed, non-recursive, $O(1)$, formula for the fibbonacci numbers $F_n = \frac{\varphi^n-\psi^n}{\sqrt 5}$. Where $\varphi = bla$ and $\psi = bla$. This blog post will explore several ways to prove this identity, in order to not only verify the formula, but see how you could have discovered it, as well as uncovering a fun connection to a $O(n)$ algorithm and linear algebra.
+
+{% endkatexmm %}
+
+<!--more-->
+
+{% katexmm %}
+
+{% endkatexmm %}