diff --git a/README.md b/README.md index 0242224..ef1981d 100644 --- a/README.md +++ b/README.md @@ -17,7 +17,7 @@ En matemáticas, los números de Fibonacci son los números en la siguiente secu 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ... ### Instalación - + ``` npm install ``` diff --git a/package-lock.json b/package-lock.json index fd061e8..92817cd 100644 --- a/package-lock.json +++ b/package-lock.json @@ -1,15 +1,15 @@ { - "name": "challenge-js-03", + "name": "javascript-challenges", "version": "1.0.0", "lockfileVersion": 2, "requires": true, "packages": { "": { - "name": "challenge-js-03", + "name": "javascript-challenges", "version": "1.0.0", "license": "MIT", "devDependencies": { - "jest": "^29.0.1" + "jest": "29.0.1" } }, "node_modules/@ampproject/remapping": { diff --git a/src/factorial.js b/src/factorial.js index 4f3ae70..d020ba6 100644 --- a/src/factorial.js +++ b/src/factorial.js @@ -1,5 +1,14 @@ const factorial = (number) => { - // your code here + var res = 1; + var num = number; + if (num === 0 || num === 1) { + return res; + } else { + for (var i=1; i<=num; i++) { + res = res * i; + } + return res; + } } module.exports = factorial; \ No newline at end of file diff --git a/src/fibonacci.js b/src/fibonacci.js index ea3270f..63b0048 100644 --- a/src/fibonacci.js +++ b/src/fibonacci.js @@ -1,5 +1,12 @@ const fibonacci = (n) => { - // your code here + if (n === 1) return [1]; + var fib = []; + fib[0] = 1; + fib[1] = 1; + for (var i = 2; i < n; i++) { + fib[i] = fib[i - 2] + fib[i - 1]; + } + return fib; } module.exports = fibonacci; \ No newline at end of file diff --git a/src/primalidad.js b/src/primalidad.js index 8bdb849..c5b13fb 100644 --- a/src/primalidad.js +++ b/src/primalidad.js @@ -1,5 +1,10 @@ const trialDivision = (number) => { - // your code here + var num = parseInt(number); + if (num <= 1) return false; + for (var i = 2; i <= num-1; i++) { + if (num % i == 0) return false; + } + return true; } module.exports = trialDivision; \ No newline at end of file