Started with 28/29 in ipython.

ipython/EulerProblem029.ipynb

@@ -0,0 +1,59 @@
+{
+ "cells": [
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "# Euler Problem 29\n",
+    "\n",
+    "Consider all integer combinations of ab for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:\n",
+    "\n",
+    "$2^2=4, 2^3=8, 2^4=16, 2^5=32$\n",
+    "\n",
+    "32=9, 33=27, 34=81, 35=243\n",
+    "\n",
+    "42=16, 43=64, 44=256, 45=1024\n",
+    "\n",
+    "52=25, 53=125, 54=625, 55=3125\n",
+    "\n",
+    "If they are then placed in numerical order, with any repeats removed, we get the following sequence of 15 distinct terms:\n",
+    "\n",
+    "4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125\n",
+    "\n",
+    "How many distinct terms are in the sequence generated by ab for 2 ≤ a ≤ 100 and 2 ≤ b ≤ 100?"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": []
+  }
+ ],
+ "metadata": {
+  "comopletion_date": "",
+  "kernelspec": {
+   "display_name": "Python 3",
+   "language": "python",
+   "name": "python3"
+  },
+  "language_info": {
+   "codemirror_mode": {
+    "name": "ipython",
+    "version": 3
+   },
+   "file_extension": ".py",
+   "mimetype": "text/x-python",
+   "name": "python",
+   "nbconvert_exporter": "python",
+   "pygments_lexer": "ipython3",
+   "version": "3.6.3"
+  },
+  "tags": []
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}