C Program to Check Prime Number

Checking whether a number is a prime number is one of the most fundamental problems in programming and mathematics. It is frequently asked in coding interviews, academic exams, and beginner programming exercises. In this detailed guide, you will learn how to write a C program to check prime number using different approaches, understand the core logic behind prime numbers, and explore real-world use cases.

A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. The most efficient C program to check for a prime number involves checking divisibility only up to the square root of the input number (√n).

This article is designed for beginners to intermediate learners and follows best practices for clarity, readability, and practical understanding.

What Is a Prime Number?

A prime number is a natural number greater than 1 that has exactly two distinct positive divisors:

• 1
• The number itself

If a number has more than two factors, it is called a composite number.

Examples of Prime Numbers

• 2 (Smallest and only even prime number)
• 3
• 5
• 7
• 11
• 13

Examples of Non-Prime Numbers

• 1 (Not prime by definition)
• 4 (Factors: 1, 2, 4)
• 6 (Factors: 1, 2, 3, 6)
• 9 (Factors: 1, 3, 9)

Why Learn a C Program to Check Prime Number?

Understanding how to check prime numbers in C helps build a strong foundation in:

• Loops and conditional statements
• Mathematical logic
• Algorithm optimization
• Problem-solving skills

Real-World Use Cases of Prime Numbers

• Cryptography: Prime numbers are used in encryption algorithms like RSA.
• Cybersecurity: Secure key generation relies on large prime numbers.
• Hashing Algorithms: Prime numbers help reduce collisions.
• Mathematics and Research: Used in number theory and scientific computations.

Basic Logic to Check Prime Number in C

The basic idea behind checking whether a number is prime is:

• If the number is less than or equal to 1, it is not prime.
• Check if the number is divisible by any number between 2 and (n - 1).
• If divisible, it is not prime.
• If not divisible by any, it is prime.

Flow of Prime Number Checking

Simple C Program to Check Prime Number

This is the most straightforward approach using a loop.

📄

#include <stdio.h>

int main() {
    int num, i, flag = 0;

    printf("Enter a number: ");
    scanf("%d", &num);

    if (num <= 1) {
        flag = 1;
    }

    for (i = 2; i < num; i++) {
        if (num % i == 0) {
            flag = 1;
            break;
        }
    }

    if (flag == 0)
        printf("%d is a prime number.", num);
    else
        printf("%d is not a prime number.", num);

    return 0;
}

Explanation of the Code

• flag variable: Used to track whether the number is prime.
• for loop: Checks divisibility from 2 to (num - 1).
• break statement: Stops the loop once a divisor is found.

Optimized C Program to Check Prime Number

The above approach works but is not efficient for large numbers. A number only needs to be checked up to its square root.

Why Check Until Square Root?

If a number n has a factor greater than √n, it must also have a factor smaller than √n.

📄

#include <stdio.h>
#include <math.h>

int main() {
    int num, i, isPrime = 1;

    printf("Enter a number: ");
    scanf("%d", &num);

    if (num <= 1) {
        isPrime = 0;
    }

    for (i = 2; i <= sqrt(num); i++) {
        if (num % i == 0) {
            isPrime = 0;
            break;
        }
    }

    if (isPrime)
        printf("%d is a prime number.", num);
    else
        printf("%d is not a prime number.", num);

    return 0;
}

Advantages of Optimized Approach

• Faster execution
• Reduced number of iterations
• Efficient for large inputs

Prime Number Check Using Function in C

Using functions improves code reusability and readability.

📄

#include <stdio.h>

int isPrime(int num) {
    int i;

    if (num <= 1)
        return 0;

    for (i = 2; i <= num / 2; i++) {
        if (num % i == 0)
            return 0;
    }
    return 1;
}

int main() {
    int number;

    printf("Enter a number: ");
    scanf("%d", &number);

    if (isPrime(number))
        printf("%d is a prime number.", number);
    else
        printf("%d is not a prime number.", number);

    return 0;
}

Common Mistakes While Checking Prime Numbers

• Considering 1 as a prime number
• Not handling negative numbers
• Using inefficient loops
• Forgetting to break the loop

Learning how to write a C program to check prime number is an essential step in mastering programming fundamentals. From basic logic to optimized approaches and function-based implementations, this topic helps strengthen your understanding of loops, conditions, and algorithm efficiency.

By practicing these examples and understanding the underlying logic, you will be better prepared for exams, interviews, and real-world programming challenges.

Frequently Asked Questions (FAQs)

1. Is 1 a prime number?

No, 1 is not a prime number because it has only one factor.

2. Why is 2 the only even prime number?

All other even numbers are divisible by 2, making them composite.

3. Which method is best to check prime numbers in C?

The square root method is the most efficient and commonly used.

4. Can negative numbers be prime?

No, prime numbers are defined only for natural numbers greater than 1.

5. Are prime numbers important in real-world applications?

Yes, prime numbers are widely used in cryptography, cybersecurity, and mathematical computations.