Scribd Logo
Upload

Welcome to Scribd!

  • 25

    Uploaded by

    One Yarri
    8 views1 page
    The C program takes a positive integer as input and uses the fundamental prime number test algorithm to check if the number is prime or not. It initializes variables, gets user input, then loops through potential factors to see if any fully divide the number without a remainder, setting a flag if so. After the loop, it prints whether the number is or isn't prime based on the flag.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The C program takes a positive integer as input and uses the fundamental prime number test algorithm to check if the number is prime or not. It initializes variables, gets user input, then loops through potential factors to see if any fully divide the number without a remainder, setting a flag if so. After the loop, it prints whether the number is or isn't prime based on the flag.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    8 views1 page

    25

    Uploaded by

    One Yarri
    The C program takes a positive integer as input and uses the fundamental prime number test algorithm to check if the number is prime or not. It initializes variables, gets user input, then loops through potential factors to see if any fully divide the number without a remainder, setting a flag if so. After the loop, it prints whether the number is or isn't prime based on the flag.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    of 1

    #include <stdio.

    h>

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

    printf("Enter a positive integer: ");


    scanf("%d", &n);

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

    if (isPrime == 1) {
    printf("%d is a prime number.\n", n);
    } else {
    printf("%d is not a prime number.\n", n);
    }

    return 0;
    }

    input: Enter a positive integer: 13


    Output: 13 is a prime number.

    input: Enter a positive integer: 16


    Output: 16 is not a prime number.

    You might also like