adding night 3 homework

isPrime.js

@@ -0,0 +1,13 @@
+//Create a function to return true or false if a number passed in a prime number
+
+var isPrime = function(num) {
+	var thisPrime = true;
+	for (i = 2; i <= Math.sqrt (num); i +=1) {
+		if (num % i === 0) {
+			thisPrime = false
+		}
+	}
+		return thisPrime;
+}
+console.log(isPrime(10));
+

numSquaredMax.js

@@ -0,0 +1,10 @@
+
+var numSquared = function(maxNum) {
+	var perfSquared = [];
+	for (i = 0; (i*i) < maxNum ; i += 1) {
+	perfSquared.push(i*i);
+	}
+	return perfSquared;
+
+}
+console.log(numSquared(200));

primesMax.js

@@ -0,0 +1,25 @@
+//Using your isPrime() function, create a function primes that will return an array of all prime numbers up to a certain amount.
+
+var isPrime = function(num) {
+	var thisPrime = true;
+	for (var i = 2; i <= Math.sqrt (num); i +=1) {
+		if (num % i === 0) {
+			thisPrime = false
+		}
+	}
+		return thisPrime;
+};
+
+var primes = function(maxPrime) {
+	var primeArr = [];
+	for (var i = 0; i < maxPrime; i += 1) {
+		if (isPrime(i) === true)  {
+			primeArr.push(i);
+		}
+
+	}
+	return primeArr;
+
+};
+console.log(primes(45));
+

sillySum.js

@@ -0,0 +1,13 @@
+
+var myArr = [1, 5, 10, 15, 7];
+
+var sillySum = function(myArr) {
+	var count = 0;
+	for (i = 0; i < myArr.length; i += 1) {
+	count += (i * myArr[i]);
+	}
+	return count;
+}
+
+console.log(sillySum(myArr));
+