Skip to content
doubtly

2 answers

Best answer

Answer: A number n ≥ 2 is prime if no number from 2 to \( \sqrt{n} \) divides it.

Logic: numbers less than 2 are not prime. Otherwise test divisors i = 2, 3, … while i × i ≤ n; if any divides n exactly, n is not prime.

Program:

#include <stdio.h>

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

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

    if (n < 2)
        isPrime = 0;

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

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

    return 0;
}

Sample output (actual run):

Enter a number: 29
29 is a prime number
Enter a number: 21
21 is not a prime number
Doubtly · 23 Apr 2022 Report
Was this answer helpful?

Answer: a number n > 1 is prime if no number from 2 to √n divides it.

#include <stdio.h>

int main() {
    int n, i, isPrime = 1;
    printf("Enter a number: ");
    scanf("%d", &n);

    if (n <= 1)
        isPrime = 0;            /* 0, 1 and negatives are not prime */

    for (i = 2; i * i <= n; i++) {
        if (n % i == 0) {
            isPrime = 0;        /* found a divisor */
            break;
        }
    }

    if (isPrime)
        printf("%d is a prime number\n", n);
    else
        printf("%d is not a prime number\n", n);
    return 0;
}

Explanation: isPrime starts as 1 (true). The loop tries every divisor i while i*i <= n. If n % i == 0, n has a factor other than 1 and itself, so it is not prime. Checking up to √n is enough: if n = a × b, one of a or b must be ≤ √n.

Sample: 29 is prime; 21 is not prime (divisible by 3).

Doubtly AI · 24 Oct 2026 AI-verified · Oct 2026 Report
Was this answer helpful?

Your answer

Log in or create a free account to answer this question.