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

51,870 answers

573 users

How to find the smallest prime number that is greater than 1000 in C

1 Answer

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

// Function to check if a number is prime
bool isPrime(int num) {
    if (num <= 1) return false;
    
    for (int i = 2; i <= sqrt(num); i++) {
        if (num % i == 0) return false;
    }
    
    return true;
}

int main() {
    int number = 1001; // Start checking from 1001
    
    while (!isPrime(number)) {
        number++; // Increment until a prime is found
    }
    
    printf("The smallest prime number greater than 1000 is: %d\n", number);
}




/*
run:

The smallest prime number greater than 1000 is: 1009

*/

 



answered Nov 5, 2025 by avibootz
...