tpyo recurisve fixed (#913)

Co-authored-by: Jay Gambetta <jay.gambetta@us.ibm.com>

Author: 708-145

tutorials/optimization/3_minimum_eigen_optimizer.ipynb

@@ -298,7 +298,7 @@
    "metadata": {},
    "source": [
     "The `RecursiveMinimumEigenOptimizer` takes a `MinimumEigenOptimizer` as input and applies the recursive optimization scheme to reduce the size of the problem one variable at a time.\n",
-    "Once the size of the generated intermediate problem is below a given threshold (`min...`), the `RecurisveMinimumEigenOptimizer` uses another solver (`...`), e.g., an exact classical solver such as CPLEX or the `MinimumEigenOptimizer` based on the `NumPyMinimumEigensolver`.\n",
+    "Once the size of the generated intermediate problem is below a given threshold (`min...`), the `RecursiveMinimumEigenOptimizer` uses another solver (`...`), e.g., an exact classical solver such as CPLEX or the `MinimumEigenOptimizer` based on the `NumPyMinimumEigensolver`.\n",
     "\n",
     "In the following, we show how to use the `RecursiveMinimumEigenOptimizer` using the two `MinimumEigenOptimizer` introduced before."
    ]
@@ -398,7 +398,7 @@
    "name": "python",
    "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
-   "version": "3.7.4"
+   "version": "3.7.7"
   },
   "toc": {
    "base_numbering": 1,