diff --git a/ipython/EulerProblem001.ipynb b/ipython/EulerProblem001.ipynb
old mode 100755
new mode 100644
diff --git a/ipython/EulerProblem002.ipynb b/ipython/EulerProblem002.ipynb
old mode 100755
new mode 100644
diff --git a/ipython/EulerProblem003.ipynb b/ipython/EulerProblem003.ipynb
index 286dcb3..b878deb 100644
--- a/ipython/EulerProblem003.ipynb
+++ b/ipython/EulerProblem003.ipynb
@@ -1,6 +1,45 @@
 {
- "cells": [],
- "metadata": {},
+ "cells": [
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "# Euler Problem 003\n",
+    "\n",
+    "The prime factors of 13195 are 5, 7, 13 and 29.\n",
+    "\n",
+    "What is the largest prime factor of the number 600851475143?"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": []
+  }
+ ],
+ "metadata": {
+  "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.4"
+  }
+ },
  "nbformat": 4,
  "nbformat_minor": 0
 }