Added tags to ipython notebooks to find previous algorithms.

ipython/EulerProblem002.ipynb

@@ -154,7 +154,10 @@
    "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
    "version": "3.5.4"
-  }
+  },
+  "tags": [
+   "fibonacci"
+  ]
  },
  "nbformat": 4,
  "nbformat_minor": 2

ipython/EulerProblem003.ipynb

@@ -21,7 +21,9 @@
   {
    "cell_type": "code",
    "execution_count": 1,
-   "metadata": {},
+   "metadata": {
+    "collapsed": true
+   },
    "outputs": [],
    "source": [
     "def get_primes_smaller(number):\n",
@@ -47,7 +49,9 @@
   {
    "cell_type": "code",
    "execution_count": 2,
-   "metadata": {},
+   "metadata": {
+    "collapsed": true
+   },
    "outputs": [],
    "source": [
     "import math\n",
@@ -82,7 +86,9 @@
   {
    "cell_type": "code",
    "execution_count": 3,
-   "metadata": {},
+   "metadata": {
+    "collapsed": false
+   },
    "outputs": [
     {
      "name": "stdout",
@@ -113,7 +119,9 @@
   {
    "cell_type": "code",
    "execution_count": 4,
-   "metadata": {},
+   "metadata": {
+    "collapsed": false
+   },
    "outputs": [
     {
      "name": "stdout",
@@ -183,8 +191,11 @@
    "name": "python",
    "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
-   "version": "3.6.3"
-  }
+   "version": "3.5.4"
+  },
+  "tags": [
+   "prime"
+  ]
  },
  "nbformat": 4,
  "nbformat_minor": 1

ipython/EulerProblem004.ipynb

@@ -53,7 +53,9 @@
   {
    "cell_type": "code",
    "execution_count": 2,
-   "metadata": {},
+   "metadata": {
+    "collapsed": false
+   },
    "outputs": [
     {
      "name": "stdout",
@@ -78,7 +80,9 @@
   {
    "cell_type": "code",
    "execution_count": 4,
-   "metadata": {},
+   "metadata": {
+    "collapsed": false
+   },
    "outputs": [
     {
      "name": "stdout",
@@ -115,7 +119,9 @@
   {
    "cell_type": "code",
    "execution_count": 5,
-   "metadata": {},
+   "metadata": {
+    "collapsed": false
+   },
    "outputs": [
     {
      "name": "stdout",
@@ -159,8 +165,12 @@
    "name": "python",
    "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
-   "version": "3.6.3"
-  }
+   "version": "3.5.4"
+  },
+  "tags": [
+   "palindrome",
+   "combinations"
+  ]
  },
  "nbformat": 4,
  "nbformat_minor": 2

ipython/EulerProblem005.ipynb

@@ -123,7 +123,11 @@
    "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
    "version": "3.5.4"
-  }
+  },
+  "tags": [
+   "reduce",
+   "divisible"
+  ]
  },
  "nbformat": 4,
  "nbformat_minor": 0

ipython/EulerProblem007.ipynb

@@ -80,7 +80,13 @@
    "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
    "version": "3.5.4"
-  }
+  },
+  "tags": [
+   "prime",
+   "nth prime",
+   "nth",
+   "generator"
+  ]
  },
  "nbformat": 4,
  "nbformat_minor": 0

ipython/ProjectEuler008.ipynb

@@ -0,0 +1,6 @@
+{
+ "cells": [],
+ "metadata": {},
+ "nbformat": 4,
+ "nbformat_minor": 0
+}