How to Check Whether a Number is Prime Number or Not in C

How to Check Whether a Number is Prime Number or Not in C:-

A number is considered as a prime number when it satisfies the below conditions.
A prime number is a number that can be divided by 1 and itself
A number that can not be divided by any other number other than 1 or itself is a prime number.
It should have only 2 factors. They are 1 and the number itself.

ALGORITHMS:-

Step 1. Read a “num” value to check prime or not.
Step 2. set i=1,div=0.
Step 3. if i<=num if true go to step 4, else go to step 7.
Step 4. Check the condition num%i==0 if true then evaluate step 5, else go to step 6.
Step 5. set div=div+1.
Step 6. i=i+1, go to step 4.
Step 7. check div, if div==2 display prime, else display not prime.
Step 8. Stop
CODE: -

#include<stdio.h>

int main()
{
    int num,i;
    printf("enter any number:");
    scanf("%d",&num);
    i=2;
    while(i<=num-1)
    {
      if(num%i==0)
      {
          printf("It is not a prime number");
          break;
      }
         i++;
    }
      if(i==num)
         printf("prime number\n");
}

OUTPUT:-

FOLLOW AND SUBSCRIBE THIS WEBPAGE FOR MORE NEW PROGRAMS AND CODING SOLUTIONS.

💬💬💬💬💗💗💗💗

Comments

Write a C program to find number is Abundant number or not

Write a C program to find the number is an Abundant number or not:- In this program to find a number is an Abundant number or not. A number n is said to be an Abundant Number to follow these condition the sum of its proper di visors is greater than the number itself. And the difference between these two values is called abundance. Ex:- Abundant number 12 having a proper divisor is 1,2,3,4,6 the sum of these factors is 16 it is greater than 12 so it is an Abundant number. Some other abundant numbers 18, 20, 24, 30, 36, 66, 70, 72, 78, 80, 84, 88, 90, 96, 100, 102, 104, 108, 112, 114, 120.. ALGORITHMS:- Step 1 - Enter the number, to find the Abundant number. Step 2 - Initialize the loop with c=1 to c<=number and follow the following calculation (i) check if whether the number is divisible with c and c got a result zero. (ii) now sum=sum+c, add a digit into a sum and store it in the sum. Step 3 . then the...

Chakra Vyuh Bhedna, the only answer to how to crack group discussions!

Chakra Vyuh Bhedna, the only answer to how to crack group discussions! Because of the pandemic, the placement drive was conducted virtually. And to add to the difficulty level, more than 200 students participated in the drive. The selection process consisted of an online test that included the aptitude and technical questions, which was followed by a group discussion. Both were elimination rounds. The shortlisted students were then called for the final round, the personal interview. All about cracking group discussions and interviews My strategy was to be attentive in the pre-placement talks by asking questions to them and even trying to answer their questions. This helped me to boost my self-confidence and made me perform well during the Group Discussion. For cracking group discussion, I practiced a simple and powerful technique called Chakra Vyuh Bhedna . It's a complete weapon to crack any GD. This technique has 4 parts. Awareness of the topic Understanding PE...

How to check if the given number is Even or odd-

1. How to check if the given number is Even or odd- We can determine whether a number is even or odd. This can be tested using different methods. The test can be done using simple methods such as testing the number’s divisibility by 2. If the remainder is zero, the number is even. If the remainder is not zero, then the number is odd. The following algorithm describes how a C program can test if a number is even or odd. CODE:- #include <stdio.h> int main () { int num;//variable declaration printf("Enter any num: ");// take input from user scanf("%d",&num);// declare input if(num%2==0) { printf("The num %d is even",num); } else { printf("The num %d is odd",num); } return 0; } ALGORITHM:- Step 1. Start Step 2 . Enter a number. Step 3. If...

Code_with_chandan

Search This Blog