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,844 questions

51,765 answers

573 users

How to check whether a number can be expressed as sum of two prime numbers in C

1 Answer

0 votes
#include <stdio.h>
#include <math.h>
#include <stdbool.h>

int isPrime(int n) {
    if (n < 2 || (n % 2 == 0 && n != 2)) {
        return 0;
    }

    int count = floor(sqrt(n));
    for (int i = 3; i <= count; i += 2) {
        if (n % i == 0) {
            return 0;
        }
    }
    return 1;
}

int main(void) {
    int n = 38;
    bool has_primes = false;

    for (int i = 2; i <= n / 2; i++) {
        if (isPrime(i)) {
            if (isPrime(n - i)) {
                printf("%d = %d + %d\n", n, i, n - i);
                has_primes = true;
            }
        }
    }

    if (!has_primes)
        printf("%d cannot be expressed as a sum of two prime numbers", n);

    return 0;
}




/*
run:

38 = 7 + 31
38 = 19 + 19

*/

 



answered Jan 12, 2022 by avibootz
...