Solve all problems passing all test

PULL_REQUEST_TEMPLATE.md

@@ -1,7 +1,7 @@
 ## DESCRIPTION
 
-Nombre:
-Usuario Platzi:
+Nombre: Roger David Alba Ortega
+Usuario Platzi: rogerdavidalbaortega@gmail.com
 
 ## Reto:
 

src/factorial.js

@@ -1,5 +1,25 @@
 const factorial = (number) => {
-  // your code here
+  let factorial=0;
+
+  if(number===0){
+    return 1;
+  }else{
+
+    for(let i=0;i<number;i++){
+      let decrement=number-i;
+      if(i){
+        factorial= decrement*factorial
+        numMinor=decrement;
+      }else{
+        factorial=decrement;
+      }
+
+
+    }
+    return factorial
+  }
+
 }
 
+
 module.exports = factorial;

src/fibonacci.js

@@ -1,5 +1,18 @@
 const fibonacci = (n) => {
-  // your code here
+  let numFibonacci= [];
+  if(n ===1){
+    numFibonacci.push(1);
+  }else if(n > 1){
+    let numBefore = 0;
+    let numAfter = 1;
+    numFibonacci.push(numBefore+numAfter);
+    for(let i=1;i<n; i++){
+      numFibonacci.push(numBefore+numAfter);
+      numBefore=numAfter;
+      numAfter= numFibonacci[i];
+    }
+  }
+  return numFibonacci;
 }
-
+fibonacci(3)
 module.exports = fibonacci;

src/primalidad.js

@@ -1,5 +1,31 @@
 const trialDivision = (number) => {
-  // your code here
+  const noFloat= number%1===0;
+  let isCousin=false;
+  let count=0;
+  if(number>1 && noFloat){
+    for(let i=1;i<=number;i++){
+      const numOdd=(number%i === 0);
+
+      if(numOdd){
+        count+=1;
+      }else{
+        count=count;
+      }
+      if(count>2){
+        isCousin=false;
+      }else{
+        isCousin=true
+      }
+
+    }
+
+  }else{
+    isCousin=false;
+  }
+  console.log(isCousin)
+  return isCousin
+
 }
+trialDivision(5)
 
 module.exports = trialDivision;