Solved 37 and added 38,39 problem statements.

ipython/EulerProblem038.ipynb

@@ -0,0 +1,61 @@
+{
+ "cells": [
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "# Euler Problem 38\n",
+    "\n",
+    "Take the number 192 and multiply it by each of 1, 2, and 3:\n",
+    "\n",
+    "$192 \\times 1 = 192$\n",
+    "\n",
+    "$192 \\times 2 = 384$\n",
+    "\n",
+    "$192 \\times 3 = 576$\n",
+    "\n",
+    "By concatenating each product we get the 1 to 9 pandigital, 192384576. We will call 192384576 the concatenated product of 192 and (1,2,3)\n",
+    "\n",
+    "The same can be achieved by starting with 9 and multiplying by 1, 2, 3, 4, and 5, giving the pandigital, 918273645, which is the concatenated product of 9 and (1,2,3,4,5).\n",
+    "\n",
+    "What is the largest 1 to 9 pandigital 9-digit number that can be formed as the concatenated product of an integer with (1,2, ... , n) where n > 1?"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": []
+  }
+ ],
+ "metadata": {
+  "completion_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.5.5"
+  },
+  "tags": [
+   "concatenated",
+   "product",
+   "pandigital"
+  ]
+ },
+ "nbformat": 4,
+ "nbformat_minor": 0
+}