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.

40,026 questions

51,982 answers

573 users

How to find the sum of all the primes below two million in C

1 Answer

0 votes
#include <math.h>
#include <stdio.h>
#include <stdbool.h>
  
bool isPrime(int n) {
    if (n == 0) return false;
    if (n == 1) return false;
  
    for (int i = 2; i <= sqrt(n); i++) {
        if (n % i == 0) {
            return false;
        }
    }
    return true;
}

int main(void) {
    long num = 2000000, sum = 0;
    
    for (int i = 2; i < num; i++) {
        if (isPrime(i)) {
            sum += i;
        }
    }
    
    printf("sum = %ld", sum);
}
  
  
  
  
/*
run:
  
sum = 142913828922
  
*/

 



answered Oct 27, 2023 by avibootz

Related questions

1 answer 89 views
1 answer 102 views
1 answer 126 views
1 answer 121 views
1 answer 98 views
...