From f5490128cdeb00bedf5d01600bf03fe38ef63c23 Mon Sep 17 00:00:00 2001
From: Marina S <138340846+bt3gl-google@users.noreply.github.com>
Date: Sun, 30 Jul 2023 21:43:03 -0700
Subject: [PATCH] Update README.md

---
 math/README.md | 14 +-------------
 1 file changed, 1 insertion(+), 13 deletions(-)

diff --git a/math/README.md b/math/README.md
index 0f841ff..abe184c 100644
--- a/math/README.md
+++ b/math/README.md
@@ -1,16 +1,4 @@
-## math, logic, dynamic programming
-
-<br>
-
-### dynamic programming
-
-<br>
-
-* take a recursive algorithm and cache overlapping problems (repeated calls).
-* the runtime is given by the number of calls.
-* **top-down**: how can we divide the problem into sub-problems?
-    * top-down dynamic programming is called **memoization**.
-* **bottom-up**: solve for a simple case, then figure out for more elements.
+## math
 
 <br>