Adding in the toy problem of the day.

Author: charltonaustin

README.md

@@ -32,3 +32,4 @@
 1. Aug  12, 2016 - Euler Problem 029 - Distinct powers
 1. Aug  13, 2016 - Euler Problem 030 - Digit fifth powers
 1. Aug  14, 2016 - Euler Problem 031 - Coin sums
+1. Aug  15, 2016 - Euler Problem 032 - Pandigital products

euler-problem-032/README.md

@@ -0,0 +1,18 @@
+We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once; for example, the 5-digit number, 15234, is 1 through 5 pandigital.
+
+The product 7254 is unusual, as the identity, 39 × 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital.
+
+Find the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through 9 pandigital.
+HINT: Some products can be obtained in more than one way so be sure to only include it once in your sum.
+
+[Source](https://projecteuler.net/problem=32)
+
+# Dependencies
+1. npm
+1. node
+
+To run Jasmine tests run
+```
+$ npm install
+$ npm test
+```

euler-problem-032/package.json

@@ -0,0 +1,14 @@
+{
+  "name": "toy-problem",
+  "version": "0.0.1",
+  "description": "Just my daily toy problems.",
+  "main": "src/problem.js",
+  "scripts": {
+    "test": "./node_modules/.bin/jasmine-node test/"
+  },
+  "author": "charlton.austin@gmail.com",
+  "license": "MIT",
+  "dependencies": {
+    "jasmine-node": "^1.14.5"
+  }
+}

euler-problem-032/src/problem.js

@@ -0,0 +1,5 @@
+var someFunction = () => {
+  return 0;
+}
+
+module.exports = {someFunction};

euler-problem-032/test/mySpec.js

@@ -0,0 +1,10 @@
+(function () {
+  'use strict';
+  var problem = require('../src/problem.js');
+  var someFunction = problem.someFunction;
+  describe('someFunction',  () => {
+    it('should return 1',  () => {
+      expect(someFunction()).toBe(1);
+    });
+  });
+})();