commit

isPrime.js

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

numSquare.js

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

primesMax.js

@@ -0,0 +1,24 @@
+//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 isPrime = true;
+for (var i = 2; i<= Math.sqrt(num); i++){
+	if (num % i == 0) {
+		var isPrime = false
+		}
+	}
+return isPrime;
+}
+
+
+ var Prime = function(maxPrime){
+	var primeArr = []
+	for (var i = 0; i<maxPrime; i++){
+		if (isPrime(i) == true ) { // calling/ passing a interger on a function
+			primeArray.push(i);
+
+		}
+    }
+    return primeArray;
+}
+console.log(prime(100));
+

sillySum.js

@@ -0,0 +1,11 @@
+sillySum(arr)
+var arr = [0,1,2];
+
+var sillySum = function (arr){
+	var count = 0;
+ 	for (i=0, i<arr.length, i += 1){
+ 		count += (i * arr[i]);
+ 	}
+	return count;
+}
+ 	console.log(sillySum(arr));