Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,926 questions

51,859 answers

573 users

How to sum all the prime numbers in an array with TypeScript

1 Answer

0 votes
function isPrime(n: number) { 
    if (n === 0 || n === 1) return 0;
     
    for (let i: number = 2; i <= Math.sqrt(n); i++) {
        if (n % i === 0) {
            return 0;
        }
    }
     
    return 1;
}
  
  
const arr: number[] = [9, 8, 17, 5, 19, 22, 21, 13, 38, 500, 99, 31];
let sumprime: number = 0;
   
for (let i: number = 0; i < arr.length; i++) {
      if (isPrime(arr[i])) { // 31 19 17 5 13
          sumprime += arr[i]; 
      }
}       
  
console.log(sumprime);
  
  
  
/*
  
85 
   
*/

 



answered Oct 24, 2024 by avibootz
...