old

isprime.js

@@ -0,0 +1,11 @@
+function isPrime(n) {
+
+   for (var i = 2; i <= Math.sqrt(n); i++) {
+      if (n % i == 0) {isPrime = false}
+   } 
+
+   return isPrime;
+
+}
+
+console.log(isPrime(39))

numSquare.js

@@ -0,0 +1,17 @@
+//Create a function called numSquare that will return 
+//an array of all perfect square numbers up to, but not exceeding a max number.
+
+var maxNumber = 500;
+var newArray = [];
+
+var numSquare = function (maxNumber) {
+	for (var i = 0; i < maxNumber; i++) {
+		if (i * i < maxNumber) {
+			var x = i * i;
+			newArray.push(x);
+		}
+	}
+	return newArray;
+}
+
+console.log(numSquare(maxNumber));

primes.js

@@ -0,0 +1,23 @@
+function isPrime(n) {
+
+   for (var i = 2; i <= Math.sqrt(n); i++) {
+      if (n % i === 0) {
+      	return false;
+      }
+   } 
+
+   return true;
+
+};
+
+function primes(maxNum) {
+	var newArray = [];
+	for (var i = 2; i <= maxNum; i+=1) {
+		if (isPrime(i) === true) {
+			newArray.push(i);
+		}
+   	} 
+   	return newArray;
+};
+
+console.log(primes(100));

sillySum.js

@@ -0,0 +1,13 @@
+//Write a function that takes an array of numbers, and returns the sum of each number multiplied by its index.
+
+var array = [1,2,3,4,5];
+
+var sillySum = function(j) {
+	var count = 0
+	for (i = 0; i < array.length; i++) {
+		count += (array[i] * i)
+	}
+	console.log(count);
+}
+
+sillySum(array);