Scribd Logo
Upload

Welcome to Scribd!

  • Include

    Uploaded by

    Adarsh Udayan
    15 views1 page
    This C program takes a user input number and determines if it is a prime or composite number. It uses a for loop to check if the input number is divisible by any number between 2 and the number minus 1. If no division results in a remainder of 0, the number is prime and this is printed. Otherwise, if any division has a 0 remainder, it is composite and this is printed along with the input number. The program is tested with sample inputs of 12 and 17 to demonstrate the output.

    Original Description:

    program code

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C program takes a user input number and determines if it is a prime or composite number. It uses a for loop to check if the input number is divisible by any number between 2 and the number minus 1. If no division results in a remainder of 0, the number is prime and this is printed. Otherwise, if any division has a 0 remainder, it is composite and this is printed along with the input number. The program is tested with sample inputs of 12 and 17 to demonstrate the output.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    15 views1 page

    Include

    Uploaded by

    Adarsh Udayan
    This C program takes a user input number and determines if it is a prime or composite number. It uses a for loop to check if the input number is divisible by any number between 2 and the number minus 1. If no division results in a remainder of 0, the number is prime and this is printed. Otherwise, if any division has a 0 remainder, it is composite and this is printed along with the input number. The program is tested with sample inputs of 12 and 17 to demonstrate the output.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    #include<stdio.h> #include<conio.

    h> void main() { clrscr(); int n,i,np=0;//np is boolean operator (true/false) printf("\n Enter a number :"); scanf("%d",&n); for(i=2;i<=(n-1);i++) /*we know that a number which is divisible by 1 and divisible by itself Is A PRIME NUMBER. So no need to check n divisible by 1 and divisible by itself */ { if(n%i==0) { np=1; break; //come out of for loop } } if(np==1) // in if statement np=1 ,it confirms that number is composite. { printf("Sorry,its composite number %d",n); } else { printf("it is a prime number %d",n); }

    OUTPUT: Enter a Number: 12 Sorry its a composite number 12 Enter a number 17 it is a prime number 17

    Read more: http://wiki.answers.com/Q/How_to_find_if_a_number_is_prime_or_composite_with_C_progra mming#ixzz27ats08Mn

    You might also like