Added index page and index page generator for all solutions.

ipython/EulerProblem002.ipynb

@@ -16,7 +16,9 @@
   {
    "cell_type": "code",
    "execution_count": 1,
-   "metadata": {},
+   "metadata": {
+    "collapsed": true
+   },
    "outputs": [],
    "source": [
     "def fibonacci_generator():\n",
@@ -58,7 +60,9 @@
   {
    "cell_type": "code",
    "execution_count": 3,
-   "metadata": {},
+   "metadata": {
+    "collapsed": true
+   },
    "outputs": [],
    "source": [
     "def get_even_fibonaccis_smaller_or_equal_four_million():\n",
@@ -82,7 +86,9 @@
   {
    "cell_type": "code",
    "execution_count": 4,
-   "metadata": {},
+   "metadata": {
+    "collapsed": false
+   },
    "outputs": [
     {
      "name": "stdout",
@@ -96,6 +102,36 @@
     "f = get_even_fibonaccis_smaller_or_equal_four_million()\n",
     "print(sum(f))"
    ]
+  },
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "I looked at the solutions in the forum and I kind of forgot about simple straight forward approaches. There is no need to create a list and the sum it up. Instead I can simply increment a counter which will be much faster, but less readable maybe."
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 5,
+   "metadata": {
+    "collapsed": false
+   },
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "4613732\n"
+     ]
+    }
+   ],
+   "source": [
+    "r, a, b = 0, 0, 1\n",
+    "while b <= 4000000:\n",
+    "    if b % 2 == 0: r += b\n",
+    "    a, b = b, a + b\n",
+    "print(r)"
+   ]
   }
  ],
  "metadata": {
@@ -114,7 +150,7 @@
    "name": "python",
    "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
-   "version": "3.6.3"
+   "version": "3.5.4"
   }
  },
  "nbformat": 4,