编写一个函数，以正整数为参数，并显示小于或等于它的所有素数之和。
网奇.NET商城系统
下载
网奇Eshop商城购物系统:集成国内优秀商城系统的成功元素,采用ASP.NET2.0语言设计开发.傻瓜式的管理模式,强大的后台管理,可添加或定制风格精美的模板,网站广告位任意添加,集成在线支付接口,内置简、繁、英三种语言.系统不断升级,力求尽善尽美.网奇商城的目标是:打造国内最到的商城系统！ 升级功能：1.在线备份SQL数据库2.RSS在线订阅器3.整合了支付宝鲜花支付接口。4.整合了网奇E客通在
解决方案
// define a function named addprimesum that takes a single parameter 'number'
function addprimesum(number) {
// initialize a variable 'result' to store the sum of prime numbers, starting from 0
let result = 0;
// define an inner function named isprime that takes a single parameter 'num'
function isprime(num) {
// if 'num' is less than 2, it is not prime, so return nothing (undefined)
if (num < 2) return;
// loop from 2 to half of 'num' to check for factors
for (let i = 2; i <= num / 2; i++) {
// if 'num' is divisible by 'i', it's not prime, so return nothing (undefined)
if (num % i === 0) return;
}
// if no factors are found, return 'num' indicating it is a prime number
return num;
}
// loop while 'number' is greater than 1
while (number > 1) {
// check if 'number' is prime using the isprime function
if (isprime(number)) {
// if it is prime, add it to 'result'
result += number;
}
// decrement 'number' by 1 to check the next lower number
number--;
}
// return the total sum of all prime numbers found
return result;
}
console.log(addprimesum(5));
console.log(addprimesum(21));
console.log(addprimesum(100));
console.log(addprimesum(239));
console.log(addprimesum(956));
解决方案
> 10 > 77 > 1060 > 5589 > 70241
