Primer reto del Near Developer Program CUMPLIDO - [email protected]

PULL_REQUEST_TEMPLATE.md

@@ -1,10 +1,10 @@
 ## DESCRIPTION
 
-Nombre:
-Usuario Platzi:
+Nombre: nahum
+Usuario Platzi: [email protected]
 
 ## Reto:
 
-- [ ] Primer problema
-- [ ] Segundo problema
-- [ ] Tercer problema
+- [x] Primer problema
+- [x] Segundo problema
+- [x] Tercer problema

src/factorial.js

@@ -1,5 +1,12 @@
 const factorial = (number) => {
-  // your code here
+  var result = number;
+  if (number === 0 || number === 1) 
+    return 1; 
+  while (number > 1) { 
+    number--;
+    result *= number;
+  }
+  return result;
 }
 
 module.exports = factorial;

src/fibonacci.js

@@ -1,5 +1,22 @@
 const fibonacci = (n) => {
-  // your code here
+
+  if (!n) return;
+
+  var fibArr = [1];
+
+  if (n === 1) {
+    console.log(fibArr);
+    return fibArr;
+  }
+
+  fibArr.push(1);
+
+  for(var i = 2, len = n; i < len; i++) {
+    fibArr.push(fibArr[i-1] + fibArr[i-2]);
+  }
+  console.log(fibArr);
+  return fibArr;
+
 }
 
 module.exports = fibonacci;

src/primalidad.js

@@ -1,5 +1,25 @@
 const trialDivision = (number) => {
-  // your code here
+  if(number % 1 == 0){
+      for (var i = 2; i < number; i++) {
+      if (number % i === 0) {
+        console.log(false);
+        return false;
+      }
+
+    }
+
+    if (number === 1 || number === -1 || number === 0) {
+      console.log(false);
+      return false;
+    } else {
+      console.log(true);
+      return true;
+    }
+  }else{
+    console.log(false);
+    return false;
+  }
+
 }
 
 module.exports = trialDivision;