diff --git a/05-Recursion/Recursion Interview Problems/03-Fibonacci-Sequence/03-Fibonacci Sequence - SOLUTION.ipynb b/05-Recursion/Recursion Interview Problems/03-Fibonacci-Sequence/03-Fibonacci Sequence - SOLUTION.ipynb
index 8dcb5da..5d635ff 100644
--- a/05-Recursion/Recursion Interview Problems/03-Fibonacci-Sequence/03-Fibonacci Sequence - SOLUTION.ipynb	
+++ b/05-Recursion/Recursion Interview Problems/03-Fibonacci-Sequence/03-Fibonacci Sequence - SOLUTION.ipynb	
@@ -6,19 +6,18 @@
     "collapsed": true
    },
    "source": [
-    "# Fibonnaci Sequence\n",
+    "# Fibonacci Sequence\n",
     "\n",
     "## Problem Statement\n",
     "\n",
-    "Implement a [Fibonnaci Sequence](https://en.wikipedia.org/wiki/Fibonacci_number) in three different ways:\n",
+    "Implement a [Fibonacci Sequence](https://en.wikipedia.org/wiki/Fibonacci_number) in three different ways:\n",
     "\n",
     "* Recursively\n",
     "* Dynamically (Using Memoization to store results)\n",
     "* Iteratively\n",
     "\n",
-    "Remember that a fibonacci sequence: 0,1,1,2,3,5,8,13,21,... starts off with a base case checking to see if n = 0 or 1, then it returns 1. \n",
+    "Remember that a Fibonacci sequence: 0,1,1,2,3,5,8,13,21,... starts off with a base case checking to see if n = 0 or n = 1. If so, it returns n, otherwise it returns fib(n-1) + fib(n-2).",
     "\n",
-    "Else it returns fib(n-1)+fib(n+2)."
    ]
   },
   {
diff --git a/05-Recursion/Recursion Interview Problems/03-Fibonacci-Sequence/03-Fibonacci Sequence.ipynb b/05-Recursion/Recursion Interview Problems/03-Fibonacci-Sequence/03-Fibonacci Sequence.ipynb
index d946ac9..df77877 100644
--- a/05-Recursion/Recursion Interview Problems/03-Fibonacci-Sequence/03-Fibonacci Sequence.ipynb	
+++ b/05-Recursion/Recursion Interview Problems/03-Fibonacci-Sequence/03-Fibonacci Sequence.ipynb	
@@ -6,13 +6,13 @@
     "collapsed": true
    },
    "source": [
-    "# Fibonnaci Sequence\n",
+    "# Fibonacci Sequence\n",
     "\n",
     "In this interview excercise we will begin to get a feel of having to solve a single problem multiple ways!\n",
     "\n",
     "## Problem Statement\n",
     "\n",
-    "Implement a [Fibonnaci Sequence](https://en.wikipedia.org/wiki/Fibonacci_number) in three different ways:\n",
+    "Implement a [Fibonacci Sequence](https://en.wikipedia.org/wiki/Fibonacci_number) in three different ways:\n",
     "\n",
     "* Recursively\n",
     "* Dynamically (Using Memoization to store results)\n",
@@ -21,9 +21,7 @@
     "#### Function Output\n",
     "Your function will accept a number **n** and return the **nth** number of the fibonacci sequence\n",
     "___\n",
-    "Remember that a fibonacci sequence: 0,1,1,2,3,5,8,13,21,... starts off with a base case checking to see if n = 0 or 1, then it returns 1. \n",
-    "\n",
-    "Else it returns fib(n-1)+fib(n+2).\n",
+    "Remember that a Fibonacci sequence: 0,1,1,2,3,5,8,13,21,... starts off with a base case checking to see if n = 0 or n = 1. If so, it returns n, otherwise it returns fib(n-1) + fib(n-2).",
     "\n",
     "____\n",
     "\n",