1. 判断一个数是否是素数
1 function isSushu (n) { 2 n = n || 0; 3 var isSu = true; 4 for (var i = 2; i <= Math.sqrt(n); i++) { 5 if (n % i === 0) { 6 isSu = false; 7 } 8 } 9 return isSu; 10 } 11 console.log(isSushu(83));
2. 求阶乘
1 function getJS (n) { 2 var JS = 1; 3 for (var i = 2; i <= n; i++) { 4 JS *= i; 5 } 6 return JS; 7 } 8 console.log(getJS(2));
3. 求1! + 2! + 3! + ... +n!
1 function getSum(n) { 2 var sum = 0; 3 for (var i = 1; i<= n; i++) { 4 var JS = 1; 5 for(var j = 1; j <= i; j++){ 6 JS *= j; 7 } 8 // sum += getJS(i); 9 sum += JS; 10 } 11 return sum; 12 } 13 console.log(getSum(3));
4. 求斐波那契数列fibonacci中的第n个数是多少??
// 1 1 2 3 5 8 13 21
1 function fibonacci (n) { 2 var arr = []; 3 arr[0] = 1; 4 arr[1] = 1; 5 for(var i = 2; i < n; i++){ 6 arr[i] = arr[i-1] + arr[i-2]; 7 } 8 return arr[n-1]; 9 } 10 11 console.log(fibonacci(3));