finding sum of prime numbers under 250

后端 未结 8 855
忘了有多久
忘了有多久 2020-12-19 18:52
var sum = 0

for (i = 0; i < 250; i++) {

    function checkIfPrime() {

        for (factor = 2; factor < i; factor++) {
            if (i % factor = 0) {
            


        
8条回答
  •  一整个雨季
    2020-12-19 19:39

    You can equally use this

    let sum = 0;
    let num = 250;
    
    
    for (let i = 2; i < num; i++) {
      let isPrime = true;
      
      for (let j = 2; j < i; j++) {
        if (i % j === 0) {
          isPrime = false;
        }
      }
      
      if (isPrime) {
        sum += i;
      }
    }
    
    console.log(sum);

提交回复
热议问题