Print Prime Numbers up to a Limit in C

✅ C Program to Print Prime Numbers from 1 to N

#include <stdio.h>

int main() {
    int n, i, j, count;

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

    printf("Prime numbers from 1 to %d are:\n", n);
    for(i = 2; i <= n; i++) {
        count = 0;
        for(j = 1; j <= i; j++) {
            if(i % j == 0) {
                count++;
            }
        }
        if(count == 2) {
            printf("%d ", i);
        }
    }

    return 0;
}
  

🧠 Explanation:

• The program takes user input n and prints all prime numbers from 1 to n.
• It checks each number i from 2 to n.
• For each i, it counts how many numbers divide it (using variable count).
• If a number has exactly 2 factors (1 and itself), it is prime and printed.

🖥️ Sample Output:

Enter the ending value: 15
Prime numbers from 1 to 15 are:
2 3 5 7 11 13
  

🔑 Keywords:

Prime number program in C, C program using nested loops, check prime in C, number logic programs, beginner-friendly C program, coding interview logic