Skip to main content

Featured

C Program to Check Prime Number Using Efficient Logic

  Introduction A prime number is a number that has exactly two distinct positive divisors: 1 and itself. In this program, we check whether a given number is prime or not using a simple and efficient logic. This type of program is commonly used in mathematics, competitive programming, and basic algorithm learning for beginners in C programming. Problem Statement The task is to write a C program that determines whether a given integer is a prime number or not. The program takes a single integer input from the user and analyzes its divisibility. If the number has no divisors other than 1 and itself, it should be identified as a prime number; otherwise, it is not prime. This problem is important in number theory and has practical relevance in areas such as cryptography, data validation, and algorithm design.  Algorithm / Logic Explanation To check whether a number is prime, we need to verify that it is not divisible by any number other than 1 and itself. The algorithm follows a si...
Post a Comment
Read more
Labels

Print Prime Numbers Between Two Numbers in C

Print Prime Numbers Between Two Numbers in C

✅ Print Prime Numbers Between Two Numbers in C

#include <stdio.h>

int main() {
    int m, n, i, j, isPrime;

    // Input range from user
    printf("Enter the starting number (m): ");
    scanf("%d", &m);

    printf("Enter the ending number (n): ");
    scanf("%d", &n);

    printf("Prime numbers between %d and %d are:\n", m, n);

    for(i = m; i <= n; i++) {
        if (i < 2) continue;

        isPrime = 1; // Assume prime

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

        if(isPrime) {
            printf("%d ", i);
        }
    }

    printf("\n");
    return 0;
}

📘 Explanation:

✅ The program reads two integers m and n.
✅ It loops from m to n and checks each number for primality.
✅ For each number, it checks if it’s divisible by any number from 2 to i/2.
✅ If no divisors are found, it's a prime and printed.

🧾 Sample Output:

Enter the starting number (m): 10
Enter the ending number (n): 25
Prime numbers between 10 and 25 are:
11 13 17 19 23

🔑 Keywords:

C prime number program, prime between two numbers, C beginner practice, loop logic, prime check algorithm in C

📌 Hashtags:

#CProgramming #PrimeNumbers #LoopingInC #BeginnerC #ProgrammingBasics #InterviewPrep

Labels:

Comments

Post a Comment

Popular Posts

🌙