//判断一个数是否是素数 function isZhiShu(n) { var isZS = true; //假设是素数 //找除了1和本身,还有没有能整数n的数 //开平方 for (var i = 2; i < n / 2; i++) { if (n % i === 0) { //出尽了,不是素数 isZS = false; } } //返回值 布尔值 return isZS; } console.log(isZhiShu(3));
//求阶乘 function getJS (n) { //阶乘 var num = 1; for (var i = 2; i <= n; i++) { num *= i; } //返回阶乘 return num; } console.log(getJS(3));
//求1! + 2! + 3! +....n! function getJS(n) { //阶乘 var num = 1; for (var i = 2; i <= n; i++) { num *= i; } //返回阶乘 return num; } function getSum(n) { var sum = 0; for (var i = 1; i <= n; i++) { //求每一个数阶乘的和; sum += getJS(i) } return sum; } console.log(getSum(9));//求斐波拿锲数 Ficonacci 中的din个数是多少? 1 ,2,3,5,8,13,21.... function getF(n) { n = n || 0; var n1 = 1; var n2 = 1; var sum = 0; for (var i = 3; i <= n; i++) { sum = n1 + n2; n1 = n2; n2 = sum; } return sum; } console.log(getF(12));