javascript prime numbers up till a certain number

// prime numbers from zero up till a certain number
const sumPrimes = (num) => {  
  let primes=[];
        // computing prime numbers from 0 uptill a number num
    for (let i = 0; i <= num; i++) {
      let flag = 0;
      // looping through 2 to user input number
      for (let j = 2; j < i; j++) {
        if (i % j == 0) {
          flag = 1;
          break;
        }
      }
      // if number greater than 1 and not divisible by other numbers
      if (i > 1 && flag == 0) {
        primes.push(i); // pushing all prime numbers in this array
      }
    }
    return primes;
}
console.log(sumPrimes(10)) // Expected output: 17

Are there any code examples left?
Made with love
This website uses cookies to make IQCode work for you. By using this site, you agree to our cookie policy

Welcome Back!

Sign up to unlock all of IQCode features:
  • Test your skills and track progress
  • Engage in comprehensive interactive courses
  • Commit to daily skill-enhancing challenges
  • Solve practical, real-world issues
  • Share your insights and learnings
Create an account
Sign in
Recover lost password
Or log in with

Create a Free Account

Sign up to unlock all of IQCode features:
  • Test your skills and track progress
  • Engage in comprehensive interactive courses
  • Commit to daily skill-enhancing challenges
  • Solve practical, real-world issues
  • Share your insights and learnings
Create an account
Sign up
Or sign up with
By signing up, you agree to the Terms and Conditions and Privacy Policy. You also agree to receive product-related marketing emails from IQCode, which you can unsubscribe from at any time.
Creating a new code example
Code snippet title
Source