Finished problem 39 and added some new ones.

ipython/EulerProblem043.ipynb

@@ -0,0 +1,73 @@
+{
+ "cells": [
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "# Sub-string divisibility (Euler Problem 43)"
+   ]
+  },
+  {
+   "cell_type": "markdown",
+   "metadata": {
+    "collapsed": true
+   },
+   "source": [
+    "The number, 1406357289, is a 0 to 9 pandigital number because it is made up of each of the digits 0 to 9 in some order, but it also has a rather interesting sub-string divisibility property.\n",
+    "\n",
+    "Let $d_1$ be the 1st digit, $d_2$ be the 2nd digit, and so on. In this way, we note the following:\n",
+    "\n",
+    "$d_2d_3d_4$=406 is divisible by 2\n",
+    "\n",
+    "$d_3d_4d_5$=063 is divisible by 3\n",
+    "\n",
+    "$d_4d_5d_6$=635 is divisible by 5\n",
+    "\n",
+    "$d_5d_6d_7=357$ is divisible by 7\n",
+    "\n",
+    "$d_6d_7d_8=572$ is divisible by 11\n",
+    "\n",
+    "$d_7d_8d_9=728$ is divisible by 13\n",
+    "\n",
+    "$d_8d_9d_{10} =289$ is divisible by 17\n",
+    "\n",
+    "Find the sum of all 0 to 9 pandigital numbers with this property."
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": []
+  }
+ ],
+ "metadata": {
+  "completion_date": "",
+  "kernelspec": {
+   "display_name": "Python 3",
+   "language": "python3.6",
+   "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.5"
+  },
+  "tags": [
+   "pandigital",
+   "divisibility"
+  ]
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}